Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.


QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

ACTIVE(U51(X1, X2)) → ACTIVE(X1)
U711(mark(X)) → U711(X)
PROPER(U32(X1, X2)) → PROPER(X2)
ACTIVE(cons(X1, X2)) → CONS(active(X1), X2)
PROPER(U86(X)) → PROPER(X)
PROPER(U11(X1, X2)) → U111(proper(X1), proper(X2))
PROPER(U31(X1, X2)) → PROPER(X1)
U331(ok(X)) → U331(X)
PROPER(U45(X1, X2)) → PROPER(X2)
U811(mark(X1), X2, X3) → U811(X1, X2, X3)
ACTIVE(isNatIList(cons(V1, V2))) → ISNATKIND(V1)
PROPER(U91(X1, X2, X3)) → U911(proper(X1), proper(X2), proper(X3))
ACTIVE(U52(X)) → U521(active(X))
PROPER(U81(X1, X2, X3)) → PROPER(X3)
ACTIVE(U21(X1, X2)) → U211(active(X1), X2)
ACTIVE(U22(tt, V1)) → ISNAT(V1)
U311(mark(X1), X2) → U311(X1, X2)
U821(mark(X1), X2, X3) → U821(X1, X2, X3)
U911(ok(X1), ok(X2), ok(X3)) → U911(X1, X2, X3)
PROPER(U11(X1, X2)) → PROPER(X2)
ACTIVE(isNatList(cons(V1, V2))) → ISNATKIND(V1)
PROPER(U12(X1, X2)) → PROPER(X2)
PROPER(U32(X1, X2)) → PROPER(X1)
U861(ok(X)) → U861(X)
ACTIVE(U44(tt, V1, V2)) → U451(isNat(V1), V2)
ACTIVE(U82(X1, X2, X3)) → U821(active(X1), X2, X3)
PROPER(U82(X1, X2, X3)) → PROPER(X2)
PROPER(U43(X1, X2, X3)) → U431(proper(X1), proper(X2), proper(X3))
ACTIVE(U32(X1, X2)) → ACTIVE(X1)
PROPER(isNatList(X)) → ISNATLIST(proper(X))
U431(ok(X1), ok(X2), ok(X3)) → U431(X1, X2, X3)
U461(ok(X)) → U461(X)
PROPER(U45(X1, X2)) → U451(proper(X1), proper(X2))
ACTIVE(U91(X1, X2, X3)) → U911(active(X1), X2, X3)
U611(ok(X)) → U611(X)
U811(ok(X1), ok(X2), ok(X3)) → U811(X1, X2, X3)
ACTIVE(U32(tt, V)) → U331(isNatList(V))
U421(ok(X1), ok(X2), ok(X3)) → U421(X1, X2, X3)
ACTIVE(U93(X1, X2, X3)) → U931(active(X1), X2, X3)
ACTIVE(U84(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U84(X1, X2, X3)) → U841(active(X1), X2, X3)
ACTIVE(U86(X)) → ACTIVE(X)
PROPER(U94(X1, X2)) → PROPER(X2)
S(ok(X)) → S(X)
PROPER(U22(X1, X2)) → U221(proper(X1), proper(X2))
CONS(mark(X1), X2) → CONS(X1, X2)
PROPER(U44(X1, X2, X3)) → PROPER(X3)
PROPER(isNatKind(X)) → ISNATKIND(proper(X))
PROPER(U41(X1, X2, X3)) → U411(proper(X1), proper(X2), proper(X3))
ACTIVE(U41(X1, X2, X3)) → U411(active(X1), X2, X3)
ACTIVE(U83(X1, X2, X3)) → ACTIVE(X1)
PROPER(cons(X1, X2)) → PROPER(X1)
U311(ok(X1), ok(X2)) → U311(X1, X2)
U931(mark(X1), X2, X3) → U931(X1, X2, X3)
PROPER(U45(X1, X2)) → PROPER(X1)
ACTIVE(U91(X1, X2, X3)) → ACTIVE(X1)
U511(mark(X1), X2) → U511(X1, X2)
S(mark(X)) → S(X)
PROPER(cons(X1, X2)) → CONS(proper(X1), proper(X2))
ISNATLIST(ok(X)) → ISNATLIST(X)
PROPER(U84(X1, X2, X3)) → PROPER(X1)
ACTIVE(isNatIListKind(cons(V1, V2))) → U511(isNatKind(V1), V2)
U131(mark(X)) → U131(X)
ACTIVE(U42(tt, V1, V2)) → U431(isNatIListKind(V2), V1, V2)
ACTIVE(U83(tt, V1, V2)) → U841(isNatIListKind(V2), V1, V2)
ACTIVE(U33(X)) → ACTIVE(X)
ACTIVE(U45(X1, X2)) → ACTIVE(X1)
U511(ok(X1), ok(X2)) → U511(X1, X2)
ACTIVE(U12(X1, X2)) → ACTIVE(X1)
PROPER(U83(X1, X2, X3)) → PROPER(X2)
ACTIVE(U31(tt, V)) → U321(isNatIListKind(V), V)
U921(mark(X1), X2, X3) → U921(X1, X2, X3)
ACTIVE(U93(tt, L, N)) → U941(isNatKind(N), L)
U121(ok(X1), ok(X2)) → U121(X1, X2)
ACTIVE(isNatList(cons(V1, V2))) → U811(isNatKind(V1), V1, V2)
ACTIVE(U41(tt, V1, V2)) → ISNATKIND(V1)
U231(mark(X)) → U231(X)
PROPER(U44(X1, X2, X3)) → PROPER(X1)
ACTIVE(U71(X)) → U711(active(X))
PROPER(U84(X1, X2, X3)) → U841(proper(X1), proper(X2), proper(X3))
PROPER(U23(X)) → PROPER(X)
PROPER(U92(X1, X2, X3)) → U921(proper(X1), proper(X2), proper(X3))
ACTIVE(U81(X1, X2, X3)) → U811(active(X1), X2, X3)
PROPER(U82(X1, X2, X3)) → U821(proper(X1), proper(X2), proper(X3))
ACTIVE(U33(X)) → U331(active(X))
ACTIVE(zeros) → CONS(0, zeros)
ACTIVE(U84(tt, V1, V2)) → U851(isNat(V1), V2)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
PROPER(U46(X)) → U461(proper(X))
ACTIVE(U82(tt, V1, V2)) → ISNATILISTKIND(V2)
ACTIVE(U51(tt, V2)) → ISNATILISTKIND(V2)
ISNATILIST(ok(X)) → ISNATILIST(X)
ACTIVE(U46(X)) → U461(active(X))
PROPER(U21(X1, X2)) → PROPER(X1)
U931(ok(X1), ok(X2), ok(X3)) → U931(X1, X2, X3)
PROPER(U12(X1, X2)) → U121(proper(X1), proper(X2))
U111(ok(X1), ok(X2)) → U111(X1, X2)
PROPER(U46(X)) → PROPER(X)
U861(mark(X)) → U861(X)
PROPER(isNatIList(X)) → ISNATILIST(proper(X))
ACTIVE(U45(X1, X2)) → U451(active(X1), X2)
PROPER(isNatIListKind(X)) → PROPER(X)
ACTIVE(isNatIList(V)) → ISNATILISTKIND(V)
ACTIVE(isNat(length(V1))) → U111(isNatIListKind(V1), V1)
PROPER(U41(X1, X2, X3)) → PROPER(X2)
ACTIVE(U86(X)) → U861(active(X))
PROPER(U22(X1, X2)) → PROPER(X2)
ISNATKIND(ok(X)) → ISNATKIND(X)
ACTIVE(U52(X)) → ACTIVE(X)
PROPER(U61(X)) → PROPER(X)
U921(ok(X1), ok(X2), ok(X3)) → U921(X1, X2, X3)
PROPER(U82(X1, X2, X3)) → PROPER(X1)
ACTIVE(U41(tt, V1, V2)) → U421(isNatKind(V1), V1, V2)
ACTIVE(U45(tt, V2)) → ISNATILIST(V2)
ACTIVE(U94(X1, X2)) → ACTIVE(X1)
ACTIVE(U92(tt, L, N)) → ISNAT(N)
U321(mark(X1), X2) → U321(X1, X2)
ACTIVE(U11(tt, V1)) → U121(isNatIListKind(V1), V1)
TOP(ok(X)) → TOP(active(X))
ACTIVE(U43(X1, X2, X3)) → U431(active(X1), X2, X3)
U451(ok(X1), ok(X2)) → U451(X1, X2)
ACTIVE(U22(tt, V1)) → U231(isNat(V1))
PROPER(U43(X1, X2, X3)) → PROPER(X3)
ISNAT(ok(X)) → ISNAT(X)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)
ACTIVE(U41(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(length(cons(N, L))) → ISNATLIST(L)
PROPER(U52(X)) → U521(proper(X))
PROPER(U44(X1, X2, X3)) → U441(proper(X1), proper(X2), proper(X3))
PROPER(U33(X)) → U331(proper(X))
ACTIVE(U83(tt, V1, V2)) → ISNATILISTKIND(V2)
PROPER(U81(X1, X2, X3)) → PROPER(X2)
ACTIVE(isNat(s(V1))) → U211(isNatKind(V1), V1)
PROPER(U42(X1, X2, X3)) → PROPER(X1)
ACTIVE(U91(tt, L, N)) → U921(isNatIListKind(L), L, N)
PROPER(U81(X1, X2, X3)) → PROPER(X1)
U431(mark(X1), X2, X3) → U431(X1, X2, X3)
ACTIVE(U92(tt, L, N)) → U931(isNat(N), L, N)
PROPER(U13(X)) → U131(proper(X))
ACTIVE(U92(X1, X2, X3)) → ACTIVE(X1)
PROPER(U94(X1, X2)) → U941(proper(X1), proper(X2))
PROPER(U11(X1, X2)) → PROPER(X1)
ACTIVE(s(X)) → S(active(X))
PROPER(U51(X1, X2)) → PROPER(X2)
ACTIVE(U45(tt, V2)) → U461(isNatIList(V2))
U221(ok(X1), ok(X2)) → U221(X1, X2)
ACTIVE(U13(X)) → ACTIVE(X)
ACTIVE(U81(X1, X2, X3)) → ACTIVE(X1)
PROPER(isNatList(X)) → PROPER(X)
ACTIVE(U44(tt, V1, V2)) → ISNAT(V1)
ACTIVE(U94(X1, X2)) → U941(active(X1), X2)
ACTIVE(isNatKind(length(V1))) → ISNATILISTKIND(V1)
PROPER(length(X)) → LENGTH(proper(X))
PROPER(U84(X1, X2, X3)) → PROPER(X3)
PROPER(U12(X1, X2)) → PROPER(X1)
U211(mark(X1), X2) → U211(X1, X2)
ACTIVE(isNatKind(length(V1))) → U611(isNatIListKind(V1))
ACTIVE(U51(tt, V2)) → U521(isNatIListKind(V2))
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
PROPER(U84(X1, X2, X3)) → PROPER(X2)
ACTIVE(U42(X1, X2, X3)) → ACTIVE(X1)
U211(ok(X1), ok(X2)) → U211(X1, X2)
ACTIVE(U94(tt, L)) → LENGTH(L)
ACTIVE(isNatIListKind(cons(V1, V2))) → ISNATKIND(V1)
PROPER(length(X)) → PROPER(X)
PROPER(U86(X)) → U861(proper(X))
PROPER(U83(X1, X2, X3)) → PROPER(X3)
PROPER(U93(X1, X2, X3)) → PROPER(X2)
ACTIVE(U11(X1, X2)) → ACTIVE(X1)
PROPER(U83(X1, X2, X3)) → PROPER(X1)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(U46(X)) → ACTIVE(X)
U831(mark(X1), X2, X3) → U831(X1, X2, X3)
PROPER(U71(X)) → U711(proper(X))
ACTIVE(U82(X1, X2, X3)) → ACTIVE(X1)
PROPER(U92(X1, X2, X3)) → PROPER(X3)
ACTIVE(U42(tt, V1, V2)) → ISNATILISTKIND(V2)
U911(mark(X1), X2, X3) → U911(X1, X2, X3)
U461(mark(X)) → U461(X)
TOP(mark(X)) → PROPER(X)
ACTIVE(U71(X)) → ACTIVE(X)
ACTIVE(U43(tt, V1, V2)) → ISNATILISTKIND(V2)
PROPER(U31(X1, X2)) → U311(proper(X1), proper(X2))
ACTIVE(U92(X1, X2, X3)) → U921(active(X1), X2, X3)
TOP(ok(X)) → ACTIVE(X)
ACTIVE(length(X)) → ACTIVE(X)
PROPER(U44(X1, X2, X3)) → PROPER(X2)
ACTIVE(U21(tt, V1)) → ISNATKIND(V1)
ACTIVE(isNat(length(V1))) → ISNATILISTKIND(V1)
PROPER(U23(X)) → U231(proper(X))
U441(ok(X1), ok(X2), ok(X3)) → U441(X1, X2, X3)
ACTIVE(U82(tt, V1, V2)) → U831(isNatIListKind(V2), V1, V2)
LENGTH(mark(X)) → LENGTH(X)
PROPER(isNatKind(X)) → PROPER(X)
U821(ok(X1), ok(X2), ok(X3)) → U821(X1, X2, X3)
U231(ok(X)) → U231(X)
U321(ok(X1), ok(X2)) → U321(X1, X2)
ACTIVE(U22(X1, X2)) → ACTIVE(X1)
ACTIVE(U12(tt, V1)) → U131(isNatList(V1))
ACTIVE(length(X)) → LENGTH(active(X))
ACTIVE(U91(tt, L, N)) → ISNATILISTKIND(L)
ACTIVE(U94(tt, L)) → S(length(L))
PROPER(U43(X1, X2, X3)) → PROPER(X2)
PROPER(U93(X1, X2, X3)) → PROPER(X3)
ACTIVE(U61(X)) → ACTIVE(X)
PROPER(U82(X1, X2, X3)) → PROPER(X3)
ACTIVE(U51(X1, X2)) → U511(active(X1), X2)
PROPER(U51(X1, X2)) → PROPER(X1)
U411(ok(X1), ok(X2), ok(X3)) → U411(X1, X2, X3)
U941(mark(X1), X2) → U941(X1, X2)
PROPER(U33(X)) → PROPER(X)
U121(mark(X1), X2) → U121(X1, X2)
PROPER(isNatIListKind(X)) → ISNATILISTKIND(proper(X))
U611(mark(X)) → U611(X)
U941(ok(X1), ok(X2)) → U941(X1, X2)
PROPER(U91(X1, X2, X3)) → PROPER(X2)
PROPER(U42(X1, X2, X3)) → U421(proper(X1), proper(X2), proper(X3))
ACTIVE(U43(tt, V1, V2)) → U441(isNatIListKind(V2), V1, V2)
PROPER(U22(X1, X2)) → PROPER(X1)
ACTIVE(U85(X1, X2)) → ACTIVE(X1)
PROPER(U94(X1, X2)) → PROPER(X1)
PROPER(U21(X1, X2)) → U211(proper(X1), proper(X2))
U131(ok(X)) → U131(X)
PROPER(U91(X1, X2, X3)) → PROPER(X1)
U841(ok(X1), ok(X2), ok(X3)) → U841(X1, X2, X3)
U421(mark(X1), X2, X3) → U421(X1, X2, X3)
ACTIVE(U21(X1, X2)) → ACTIVE(X1)
ACTIVE(U21(tt, V1)) → U221(isNatKind(V1), V1)
ACTIVE(U32(X1, X2)) → U321(active(X1), X2)
U411(mark(X1), X2, X3) → U411(X1, X2, X3)
PROPER(U13(X)) → PROPER(X)
PROPER(U85(X1, X2)) → PROPER(X2)
ACTIVE(U42(X1, X2, X3)) → U421(active(X1), X2, X3)
U451(mark(X1), X2) → U451(X1, X2)
ACTIVE(U61(X)) → U611(active(X))
PROPER(cons(X1, X2)) → PROPER(X2)
ISNATILISTKIND(ok(X)) → ISNATILISTKIND(X)
U331(mark(X)) → U331(X)
PROPER(U42(X1, X2, X3)) → PROPER(X3)
PROPER(U41(X1, X2, X3)) → PROPER(X1)
ACTIVE(U85(tt, V2)) → U861(isNatList(V2))
PROPER(U61(X)) → U611(proper(X))
PROPER(U93(X1, X2, X3)) → U931(proper(X1), proper(X2), proper(X3))
ACTIVE(U31(X1, X2)) → U311(active(X1), X2)
ACTIVE(U44(X1, X2, X3)) → U441(active(X1), X2, X3)
ACTIVE(isNatIList(cons(V1, V2))) → U411(isNatKind(V1), V1, V2)
PROPER(U85(X1, X2)) → U851(proper(X1), proper(X2))
PROPER(U41(X1, X2, X3)) → PROPER(X3)
ACTIVE(U22(X1, X2)) → U221(active(X1), X2)
U711(ok(X)) → U711(X)
PROPER(s(X)) → S(proper(X))
ACTIVE(U85(tt, V2)) → ISNATLIST(V2)
ACTIVE(U31(tt, V)) → ISNATILISTKIND(V)
ACTIVE(U23(X)) → U231(active(X))
ACTIVE(U44(X1, X2, X3)) → ACTIVE(X1)
PROPER(U92(X1, X2, X3)) → PROPER(X2)
PROPER(U52(X)) → PROPER(X)
U441(mark(X1), X2, X3) → U441(X1, X2, X3)
ACTIVE(isNat(s(V1))) → ISNATKIND(V1)
PROPER(U42(X1, X2, X3)) → PROPER(X2)
U111(mark(X1), X2) → U111(X1, X2)
PROPER(U92(X1, X2, X3)) → PROPER(X1)
PROPER(U81(X1, X2, X3)) → U811(proper(X1), proper(X2), proper(X3))
U221(mark(X1), X2) → U221(X1, X2)
ACTIVE(U13(X)) → U131(active(X))
U521(mark(X)) → U521(X)
PROPER(isNat(X)) → PROPER(X)
LENGTH(ok(X)) → LENGTH(X)
U851(mark(X1), X2) → U851(X1, X2)
ACTIVE(U93(tt, L, N)) → ISNATKIND(N)
PROPER(U32(X1, X2)) → U321(proper(X1), proper(X2))
PROPER(U93(X1, X2, X3)) → PROPER(X1)
PROPER(isNatIList(X)) → PROPER(X)
ACTIVE(isNatKind(s(V1))) → U711(isNatKind(V1))
ACTIVE(U43(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U81(tt, V1, V2)) → ISNATKIND(V1)
U841(mark(X1), X2, X3) → U841(X1, X2, X3)
PROPER(s(X)) → PROPER(X)
ACTIVE(U93(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(isNatIList(V)) → U311(isNatIListKind(V), V)
ACTIVE(U11(X1, X2)) → U111(active(X1), X2)
PROPER(U91(X1, X2, X3)) → PROPER(X3)
PROPER(isNat(X)) → ISNAT(proper(X))
ACTIVE(U23(X)) → ACTIVE(X)
ACTIVE(isNatKind(s(V1))) → ISNATKIND(V1)
ACTIVE(U12(tt, V1)) → ISNATLIST(V1)
PROPER(U43(X1, X2, X3)) → PROPER(X1)
PROPER(U31(X1, X2)) → PROPER(X2)
U851(ok(X1), ok(X2)) → U851(X1, X2)
U521(ok(X)) → U521(X)
ACTIVE(U85(X1, X2)) → U851(active(X1), X2)
PROPER(U71(X)) → PROPER(X)
PROPER(U85(X1, X2)) → PROPER(X1)
ACTIVE(U81(tt, V1, V2)) → U821(isNatKind(V1), V1, V2)
ACTIVE(U84(tt, V1, V2)) → ISNAT(V1)
PROPER(U51(X1, X2)) → U511(proper(X1), proper(X2))
ACTIVE(U83(X1, X2, X3)) → U831(active(X1), X2, X3)
ACTIVE(U32(tt, V)) → ISNATLIST(V)
ACTIVE(length(cons(N, L))) → U911(isNatList(L), L, N)
TOP(mark(X)) → TOP(proper(X))
U831(ok(X1), ok(X2), ok(X3)) → U831(X1, X2, X3)
PROPER(U21(X1, X2)) → PROPER(X2)
ACTIVE(U12(X1, X2)) → U121(active(X1), X2)
ACTIVE(U11(tt, V1)) → ISNATILISTKIND(V1)
PROPER(U83(X1, X2, X3)) → U831(proper(X1), proper(X2), proper(X3))

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(U51(X1, X2)) → ACTIVE(X1)
U711(mark(X)) → U711(X)
PROPER(U32(X1, X2)) → PROPER(X2)
ACTIVE(cons(X1, X2)) → CONS(active(X1), X2)
PROPER(U86(X)) → PROPER(X)
PROPER(U11(X1, X2)) → U111(proper(X1), proper(X2))
PROPER(U31(X1, X2)) → PROPER(X1)
U331(ok(X)) → U331(X)
PROPER(U45(X1, X2)) → PROPER(X2)
U811(mark(X1), X2, X3) → U811(X1, X2, X3)
ACTIVE(isNatIList(cons(V1, V2))) → ISNATKIND(V1)
PROPER(U91(X1, X2, X3)) → U911(proper(X1), proper(X2), proper(X3))
ACTIVE(U52(X)) → U521(active(X))
PROPER(U81(X1, X2, X3)) → PROPER(X3)
ACTIVE(U21(X1, X2)) → U211(active(X1), X2)
ACTIVE(U22(tt, V1)) → ISNAT(V1)
U311(mark(X1), X2) → U311(X1, X2)
U821(mark(X1), X2, X3) → U821(X1, X2, X3)
U911(ok(X1), ok(X2), ok(X3)) → U911(X1, X2, X3)
PROPER(U11(X1, X2)) → PROPER(X2)
ACTIVE(isNatList(cons(V1, V2))) → ISNATKIND(V1)
PROPER(U12(X1, X2)) → PROPER(X2)
PROPER(U32(X1, X2)) → PROPER(X1)
U861(ok(X)) → U861(X)
ACTIVE(U44(tt, V1, V2)) → U451(isNat(V1), V2)
ACTIVE(U82(X1, X2, X3)) → U821(active(X1), X2, X3)
PROPER(U82(X1, X2, X3)) → PROPER(X2)
PROPER(U43(X1, X2, X3)) → U431(proper(X1), proper(X2), proper(X3))
ACTIVE(U32(X1, X2)) → ACTIVE(X1)
PROPER(isNatList(X)) → ISNATLIST(proper(X))
U431(ok(X1), ok(X2), ok(X3)) → U431(X1, X2, X3)
U461(ok(X)) → U461(X)
PROPER(U45(X1, X2)) → U451(proper(X1), proper(X2))
ACTIVE(U91(X1, X2, X3)) → U911(active(X1), X2, X3)
U611(ok(X)) → U611(X)
U811(ok(X1), ok(X2), ok(X3)) → U811(X1, X2, X3)
ACTIVE(U32(tt, V)) → U331(isNatList(V))
U421(ok(X1), ok(X2), ok(X3)) → U421(X1, X2, X3)
ACTIVE(U93(X1, X2, X3)) → U931(active(X1), X2, X3)
ACTIVE(U84(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U84(X1, X2, X3)) → U841(active(X1), X2, X3)
ACTIVE(U86(X)) → ACTIVE(X)
PROPER(U94(X1, X2)) → PROPER(X2)
S(ok(X)) → S(X)
PROPER(U22(X1, X2)) → U221(proper(X1), proper(X2))
CONS(mark(X1), X2) → CONS(X1, X2)
PROPER(U44(X1, X2, X3)) → PROPER(X3)
PROPER(isNatKind(X)) → ISNATKIND(proper(X))
PROPER(U41(X1, X2, X3)) → U411(proper(X1), proper(X2), proper(X3))
ACTIVE(U41(X1, X2, X3)) → U411(active(X1), X2, X3)
ACTIVE(U83(X1, X2, X3)) → ACTIVE(X1)
PROPER(cons(X1, X2)) → PROPER(X1)
U311(ok(X1), ok(X2)) → U311(X1, X2)
U931(mark(X1), X2, X3) → U931(X1, X2, X3)
PROPER(U45(X1, X2)) → PROPER(X1)
ACTIVE(U91(X1, X2, X3)) → ACTIVE(X1)
U511(mark(X1), X2) → U511(X1, X2)
S(mark(X)) → S(X)
PROPER(cons(X1, X2)) → CONS(proper(X1), proper(X2))
ISNATLIST(ok(X)) → ISNATLIST(X)
PROPER(U84(X1, X2, X3)) → PROPER(X1)
ACTIVE(isNatIListKind(cons(V1, V2))) → U511(isNatKind(V1), V2)
U131(mark(X)) → U131(X)
ACTIVE(U42(tt, V1, V2)) → U431(isNatIListKind(V2), V1, V2)
ACTIVE(U83(tt, V1, V2)) → U841(isNatIListKind(V2), V1, V2)
ACTIVE(U33(X)) → ACTIVE(X)
ACTIVE(U45(X1, X2)) → ACTIVE(X1)
U511(ok(X1), ok(X2)) → U511(X1, X2)
ACTIVE(U12(X1, X2)) → ACTIVE(X1)
PROPER(U83(X1, X2, X3)) → PROPER(X2)
ACTIVE(U31(tt, V)) → U321(isNatIListKind(V), V)
U921(mark(X1), X2, X3) → U921(X1, X2, X3)
ACTIVE(U93(tt, L, N)) → U941(isNatKind(N), L)
U121(ok(X1), ok(X2)) → U121(X1, X2)
ACTIVE(isNatList(cons(V1, V2))) → U811(isNatKind(V1), V1, V2)
ACTIVE(U41(tt, V1, V2)) → ISNATKIND(V1)
U231(mark(X)) → U231(X)
PROPER(U44(X1, X2, X3)) → PROPER(X1)
ACTIVE(U71(X)) → U711(active(X))
PROPER(U84(X1, X2, X3)) → U841(proper(X1), proper(X2), proper(X3))
PROPER(U23(X)) → PROPER(X)
PROPER(U92(X1, X2, X3)) → U921(proper(X1), proper(X2), proper(X3))
ACTIVE(U81(X1, X2, X3)) → U811(active(X1), X2, X3)
PROPER(U82(X1, X2, X3)) → U821(proper(X1), proper(X2), proper(X3))
ACTIVE(U33(X)) → U331(active(X))
ACTIVE(zeros) → CONS(0, zeros)
ACTIVE(U84(tt, V1, V2)) → U851(isNat(V1), V2)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
PROPER(U46(X)) → U461(proper(X))
ACTIVE(U82(tt, V1, V2)) → ISNATILISTKIND(V2)
ACTIVE(U51(tt, V2)) → ISNATILISTKIND(V2)
ISNATILIST(ok(X)) → ISNATILIST(X)
ACTIVE(U46(X)) → U461(active(X))
PROPER(U21(X1, X2)) → PROPER(X1)
U931(ok(X1), ok(X2), ok(X3)) → U931(X1, X2, X3)
PROPER(U12(X1, X2)) → U121(proper(X1), proper(X2))
U111(ok(X1), ok(X2)) → U111(X1, X2)
PROPER(U46(X)) → PROPER(X)
U861(mark(X)) → U861(X)
PROPER(isNatIList(X)) → ISNATILIST(proper(X))
ACTIVE(U45(X1, X2)) → U451(active(X1), X2)
PROPER(isNatIListKind(X)) → PROPER(X)
ACTIVE(isNatIList(V)) → ISNATILISTKIND(V)
ACTIVE(isNat(length(V1))) → U111(isNatIListKind(V1), V1)
PROPER(U41(X1, X2, X3)) → PROPER(X2)
ACTIVE(U86(X)) → U861(active(X))
PROPER(U22(X1, X2)) → PROPER(X2)
ISNATKIND(ok(X)) → ISNATKIND(X)
ACTIVE(U52(X)) → ACTIVE(X)
PROPER(U61(X)) → PROPER(X)
U921(ok(X1), ok(X2), ok(X3)) → U921(X1, X2, X3)
PROPER(U82(X1, X2, X3)) → PROPER(X1)
ACTIVE(U41(tt, V1, V2)) → U421(isNatKind(V1), V1, V2)
ACTIVE(U45(tt, V2)) → ISNATILIST(V2)
ACTIVE(U94(X1, X2)) → ACTIVE(X1)
ACTIVE(U92(tt, L, N)) → ISNAT(N)
U321(mark(X1), X2) → U321(X1, X2)
ACTIVE(U11(tt, V1)) → U121(isNatIListKind(V1), V1)
TOP(ok(X)) → TOP(active(X))
ACTIVE(U43(X1, X2, X3)) → U431(active(X1), X2, X3)
U451(ok(X1), ok(X2)) → U451(X1, X2)
ACTIVE(U22(tt, V1)) → U231(isNat(V1))
PROPER(U43(X1, X2, X3)) → PROPER(X3)
ISNAT(ok(X)) → ISNAT(X)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)
ACTIVE(U41(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(length(cons(N, L))) → ISNATLIST(L)
PROPER(U52(X)) → U521(proper(X))
PROPER(U44(X1, X2, X3)) → U441(proper(X1), proper(X2), proper(X3))
PROPER(U33(X)) → U331(proper(X))
ACTIVE(U83(tt, V1, V2)) → ISNATILISTKIND(V2)
PROPER(U81(X1, X2, X3)) → PROPER(X2)
ACTIVE(isNat(s(V1))) → U211(isNatKind(V1), V1)
PROPER(U42(X1, X2, X3)) → PROPER(X1)
ACTIVE(U91(tt, L, N)) → U921(isNatIListKind(L), L, N)
PROPER(U81(X1, X2, X3)) → PROPER(X1)
U431(mark(X1), X2, X3) → U431(X1, X2, X3)
ACTIVE(U92(tt, L, N)) → U931(isNat(N), L, N)
PROPER(U13(X)) → U131(proper(X))
ACTIVE(U92(X1, X2, X3)) → ACTIVE(X1)
PROPER(U94(X1, X2)) → U941(proper(X1), proper(X2))
PROPER(U11(X1, X2)) → PROPER(X1)
ACTIVE(s(X)) → S(active(X))
PROPER(U51(X1, X2)) → PROPER(X2)
ACTIVE(U45(tt, V2)) → U461(isNatIList(V2))
U221(ok(X1), ok(X2)) → U221(X1, X2)
ACTIVE(U13(X)) → ACTIVE(X)
ACTIVE(U81(X1, X2, X3)) → ACTIVE(X1)
PROPER(isNatList(X)) → PROPER(X)
ACTIVE(U44(tt, V1, V2)) → ISNAT(V1)
ACTIVE(U94(X1, X2)) → U941(active(X1), X2)
ACTIVE(isNatKind(length(V1))) → ISNATILISTKIND(V1)
PROPER(length(X)) → LENGTH(proper(X))
PROPER(U84(X1, X2, X3)) → PROPER(X3)
PROPER(U12(X1, X2)) → PROPER(X1)
U211(mark(X1), X2) → U211(X1, X2)
ACTIVE(isNatKind(length(V1))) → U611(isNatIListKind(V1))
ACTIVE(U51(tt, V2)) → U521(isNatIListKind(V2))
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
PROPER(U84(X1, X2, X3)) → PROPER(X2)
ACTIVE(U42(X1, X2, X3)) → ACTIVE(X1)
U211(ok(X1), ok(X2)) → U211(X1, X2)
ACTIVE(U94(tt, L)) → LENGTH(L)
ACTIVE(isNatIListKind(cons(V1, V2))) → ISNATKIND(V1)
PROPER(length(X)) → PROPER(X)
PROPER(U86(X)) → U861(proper(X))
PROPER(U83(X1, X2, X3)) → PROPER(X3)
PROPER(U93(X1, X2, X3)) → PROPER(X2)
ACTIVE(U11(X1, X2)) → ACTIVE(X1)
PROPER(U83(X1, X2, X3)) → PROPER(X1)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(U46(X)) → ACTIVE(X)
U831(mark(X1), X2, X3) → U831(X1, X2, X3)
PROPER(U71(X)) → U711(proper(X))
ACTIVE(U82(X1, X2, X3)) → ACTIVE(X1)
PROPER(U92(X1, X2, X3)) → PROPER(X3)
ACTIVE(U42(tt, V1, V2)) → ISNATILISTKIND(V2)
U911(mark(X1), X2, X3) → U911(X1, X2, X3)
U461(mark(X)) → U461(X)
TOP(mark(X)) → PROPER(X)
ACTIVE(U71(X)) → ACTIVE(X)
ACTIVE(U43(tt, V1, V2)) → ISNATILISTKIND(V2)
PROPER(U31(X1, X2)) → U311(proper(X1), proper(X2))
ACTIVE(U92(X1, X2, X3)) → U921(active(X1), X2, X3)
TOP(ok(X)) → ACTIVE(X)
ACTIVE(length(X)) → ACTIVE(X)
PROPER(U44(X1, X2, X3)) → PROPER(X2)
ACTIVE(U21(tt, V1)) → ISNATKIND(V1)
ACTIVE(isNat(length(V1))) → ISNATILISTKIND(V1)
PROPER(U23(X)) → U231(proper(X))
U441(ok(X1), ok(X2), ok(X3)) → U441(X1, X2, X3)
ACTIVE(U82(tt, V1, V2)) → U831(isNatIListKind(V2), V1, V2)
LENGTH(mark(X)) → LENGTH(X)
PROPER(isNatKind(X)) → PROPER(X)
U821(ok(X1), ok(X2), ok(X3)) → U821(X1, X2, X3)
U231(ok(X)) → U231(X)
U321(ok(X1), ok(X2)) → U321(X1, X2)
ACTIVE(U22(X1, X2)) → ACTIVE(X1)
ACTIVE(U12(tt, V1)) → U131(isNatList(V1))
ACTIVE(length(X)) → LENGTH(active(X))
ACTIVE(U91(tt, L, N)) → ISNATILISTKIND(L)
ACTIVE(U94(tt, L)) → S(length(L))
PROPER(U43(X1, X2, X3)) → PROPER(X2)
PROPER(U93(X1, X2, X3)) → PROPER(X3)
ACTIVE(U61(X)) → ACTIVE(X)
PROPER(U82(X1, X2, X3)) → PROPER(X3)
ACTIVE(U51(X1, X2)) → U511(active(X1), X2)
PROPER(U51(X1, X2)) → PROPER(X1)
U411(ok(X1), ok(X2), ok(X3)) → U411(X1, X2, X3)
U941(mark(X1), X2) → U941(X1, X2)
PROPER(U33(X)) → PROPER(X)
U121(mark(X1), X2) → U121(X1, X2)
PROPER(isNatIListKind(X)) → ISNATILISTKIND(proper(X))
U611(mark(X)) → U611(X)
U941(ok(X1), ok(X2)) → U941(X1, X2)
PROPER(U91(X1, X2, X3)) → PROPER(X2)
PROPER(U42(X1, X2, X3)) → U421(proper(X1), proper(X2), proper(X3))
ACTIVE(U43(tt, V1, V2)) → U441(isNatIListKind(V2), V1, V2)
PROPER(U22(X1, X2)) → PROPER(X1)
ACTIVE(U85(X1, X2)) → ACTIVE(X1)
PROPER(U94(X1, X2)) → PROPER(X1)
PROPER(U21(X1, X2)) → U211(proper(X1), proper(X2))
U131(ok(X)) → U131(X)
PROPER(U91(X1, X2, X3)) → PROPER(X1)
U841(ok(X1), ok(X2), ok(X3)) → U841(X1, X2, X3)
U421(mark(X1), X2, X3) → U421(X1, X2, X3)
ACTIVE(U21(X1, X2)) → ACTIVE(X1)
ACTIVE(U21(tt, V1)) → U221(isNatKind(V1), V1)
ACTIVE(U32(X1, X2)) → U321(active(X1), X2)
U411(mark(X1), X2, X3) → U411(X1, X2, X3)
PROPER(U13(X)) → PROPER(X)
PROPER(U85(X1, X2)) → PROPER(X2)
ACTIVE(U42(X1, X2, X3)) → U421(active(X1), X2, X3)
U451(mark(X1), X2) → U451(X1, X2)
ACTIVE(U61(X)) → U611(active(X))
PROPER(cons(X1, X2)) → PROPER(X2)
ISNATILISTKIND(ok(X)) → ISNATILISTKIND(X)
U331(mark(X)) → U331(X)
PROPER(U42(X1, X2, X3)) → PROPER(X3)
PROPER(U41(X1, X2, X3)) → PROPER(X1)
ACTIVE(U85(tt, V2)) → U861(isNatList(V2))
PROPER(U61(X)) → U611(proper(X))
PROPER(U93(X1, X2, X3)) → U931(proper(X1), proper(X2), proper(X3))
ACTIVE(U31(X1, X2)) → U311(active(X1), X2)
ACTIVE(U44(X1, X2, X3)) → U441(active(X1), X2, X3)
ACTIVE(isNatIList(cons(V1, V2))) → U411(isNatKind(V1), V1, V2)
PROPER(U85(X1, X2)) → U851(proper(X1), proper(X2))
PROPER(U41(X1, X2, X3)) → PROPER(X3)
ACTIVE(U22(X1, X2)) → U221(active(X1), X2)
U711(ok(X)) → U711(X)
PROPER(s(X)) → S(proper(X))
ACTIVE(U85(tt, V2)) → ISNATLIST(V2)
ACTIVE(U31(tt, V)) → ISNATILISTKIND(V)
ACTIVE(U23(X)) → U231(active(X))
ACTIVE(U44(X1, X2, X3)) → ACTIVE(X1)
PROPER(U92(X1, X2, X3)) → PROPER(X2)
PROPER(U52(X)) → PROPER(X)
U441(mark(X1), X2, X3) → U441(X1, X2, X3)
ACTIVE(isNat(s(V1))) → ISNATKIND(V1)
PROPER(U42(X1, X2, X3)) → PROPER(X2)
U111(mark(X1), X2) → U111(X1, X2)
PROPER(U92(X1, X2, X3)) → PROPER(X1)
PROPER(U81(X1, X2, X3)) → U811(proper(X1), proper(X2), proper(X3))
U221(mark(X1), X2) → U221(X1, X2)
ACTIVE(U13(X)) → U131(active(X))
U521(mark(X)) → U521(X)
PROPER(isNat(X)) → PROPER(X)
LENGTH(ok(X)) → LENGTH(X)
U851(mark(X1), X2) → U851(X1, X2)
ACTIVE(U93(tt, L, N)) → ISNATKIND(N)
PROPER(U32(X1, X2)) → U321(proper(X1), proper(X2))
PROPER(U93(X1, X2, X3)) → PROPER(X1)
PROPER(isNatIList(X)) → PROPER(X)
ACTIVE(isNatKind(s(V1))) → U711(isNatKind(V1))
ACTIVE(U43(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U81(tt, V1, V2)) → ISNATKIND(V1)
U841(mark(X1), X2, X3) → U841(X1, X2, X3)
PROPER(s(X)) → PROPER(X)
ACTIVE(U93(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(isNatIList(V)) → U311(isNatIListKind(V), V)
ACTIVE(U11(X1, X2)) → U111(active(X1), X2)
PROPER(U91(X1, X2, X3)) → PROPER(X3)
PROPER(isNat(X)) → ISNAT(proper(X))
ACTIVE(U23(X)) → ACTIVE(X)
ACTIVE(isNatKind(s(V1))) → ISNATKIND(V1)
ACTIVE(U12(tt, V1)) → ISNATLIST(V1)
PROPER(U43(X1, X2, X3)) → PROPER(X1)
PROPER(U31(X1, X2)) → PROPER(X2)
U851(ok(X1), ok(X2)) → U851(X1, X2)
U521(ok(X)) → U521(X)
ACTIVE(U85(X1, X2)) → U851(active(X1), X2)
PROPER(U71(X)) → PROPER(X)
PROPER(U85(X1, X2)) → PROPER(X1)
ACTIVE(U81(tt, V1, V2)) → U821(isNatKind(V1), V1, V2)
ACTIVE(U84(tt, V1, V2)) → ISNAT(V1)
PROPER(U51(X1, X2)) → U511(proper(X1), proper(X2))
ACTIVE(U83(X1, X2, X3)) → U831(active(X1), X2, X3)
ACTIVE(U32(tt, V)) → ISNATLIST(V)
ACTIVE(length(cons(N, L))) → U911(isNatList(L), L, N)
TOP(mark(X)) → TOP(proper(X))
U831(ok(X1), ok(X2), ok(X3)) → U831(X1, X2, X3)
PROPER(U21(X1, X2)) → PROPER(X2)
ACTIVE(U12(X1, X2)) → U121(active(X1), X2)
ACTIVE(U11(tt, V1)) → ISNATILISTKIND(V1)
PROPER(U83(X1, X2, X3)) → U831(proper(X1), proper(X2), proper(X3))

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 40 SCCs with 132 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ISNATILIST(ok(X)) → ISNATILIST(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ISNATILIST(ok(X)) → ISNATILIST(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ISNAT(ok(X)) → ISNAT(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ISNAT(ok(X)) → ISNAT(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ISNATKIND(ok(X)) → ISNATKIND(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ISNATKIND(ok(X)) → ISNATKIND(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ISNATLIST(ok(X)) → ISNATLIST(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ISNATLIST(ok(X)) → ISNATLIST(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ISNATILISTKIND(ok(X)) → ISNATILISTKIND(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ISNATILISTKIND(ok(X)) → ISNATILISTKIND(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LENGTH(ok(X)) → LENGTH(X)
LENGTH(mark(X)) → LENGTH(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LENGTH(ok(X)) → LENGTH(X)
LENGTH(mark(X)) → LENGTH(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S(ok(X)) → S(X)
S(mark(X)) → S(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S(ok(X)) → S(X)
S(mark(X)) → S(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U941(mark(X1), X2) → U941(X1, X2)
U941(ok(X1), ok(X2)) → U941(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U941(mark(X1), X2) → U941(X1, X2)
U941(ok(X1), ok(X2)) → U941(X1, X2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U931(ok(X1), ok(X2), ok(X3)) → U931(X1, X2, X3)
U931(mark(X1), X2, X3) → U931(X1, X2, X3)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U931(ok(X1), ok(X2), ok(X3)) → U931(X1, X2, X3)
U931(mark(X1), X2, X3) → U931(X1, X2, X3)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U921(ok(X1), ok(X2), ok(X3)) → U921(X1, X2, X3)
U921(mark(X1), X2, X3) → U921(X1, X2, X3)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U921(ok(X1), ok(X2), ok(X3)) → U921(X1, X2, X3)
U921(mark(X1), X2, X3) → U921(X1, X2, X3)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U911(mark(X1), X2, X3) → U911(X1, X2, X3)
U911(ok(X1), ok(X2), ok(X3)) → U911(X1, X2, X3)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U911(mark(X1), X2, X3) → U911(X1, X2, X3)
U911(ok(X1), ok(X2), ok(X3)) → U911(X1, X2, X3)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U861(mark(X)) → U861(X)
U861(ok(X)) → U861(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U861(mark(X)) → U861(X)
U861(ok(X)) → U861(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U851(mark(X1), X2) → U851(X1, X2)
U851(ok(X1), ok(X2)) → U851(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U851(mark(X1), X2) → U851(X1, X2)
U851(ok(X1), ok(X2)) → U851(X1, X2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U841(mark(X1), X2, X3) → U841(X1, X2, X3)
U841(ok(X1), ok(X2), ok(X3)) → U841(X1, X2, X3)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U841(mark(X1), X2, X3) → U841(X1, X2, X3)
U841(ok(X1), ok(X2), ok(X3)) → U841(X1, X2, X3)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U831(ok(X1), ok(X2), ok(X3)) → U831(X1, X2, X3)
U831(mark(X1), X2, X3) → U831(X1, X2, X3)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U831(ok(X1), ok(X2), ok(X3)) → U831(X1, X2, X3)
U831(mark(X1), X2, X3) → U831(X1, X2, X3)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U821(ok(X1), ok(X2), ok(X3)) → U821(X1, X2, X3)
U821(mark(X1), X2, X3) → U821(X1, X2, X3)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U821(ok(X1), ok(X2), ok(X3)) → U821(X1, X2, X3)
U821(mark(X1), X2, X3) → U821(X1, X2, X3)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U811(mark(X1), X2, X3) → U811(X1, X2, X3)
U811(ok(X1), ok(X2), ok(X3)) → U811(X1, X2, X3)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U811(mark(X1), X2, X3) → U811(X1, X2, X3)
U811(ok(X1), ok(X2), ok(X3)) → U811(X1, X2, X3)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U711(mark(X)) → U711(X)
U711(ok(X)) → U711(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U711(mark(X)) → U711(X)
U711(ok(X)) → U711(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U611(ok(X)) → U611(X)
U611(mark(X)) → U611(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U611(ok(X)) → U611(X)
U611(mark(X)) → U611(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U521(mark(X)) → U521(X)
U521(ok(X)) → U521(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U521(mark(X)) → U521(X)
U521(ok(X)) → U521(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U511(ok(X1), ok(X2)) → U511(X1, X2)
U511(mark(X1), X2) → U511(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U511(ok(X1), ok(X2)) → U511(X1, X2)
U511(mark(X1), X2) → U511(X1, X2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U461(mark(X)) → U461(X)
U461(ok(X)) → U461(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U461(mark(X)) → U461(X)
U461(ok(X)) → U461(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U451(ok(X1), ok(X2)) → U451(X1, X2)
U451(mark(X1), X2) → U451(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U451(ok(X1), ok(X2)) → U451(X1, X2)
U451(mark(X1), X2) → U451(X1, X2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U441(mark(X1), X2, X3) → U441(X1, X2, X3)
U441(ok(X1), ok(X2), ok(X3)) → U441(X1, X2, X3)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U441(mark(X1), X2, X3) → U441(X1, X2, X3)
U441(ok(X1), ok(X2), ok(X3)) → U441(X1, X2, X3)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U431(mark(X1), X2, X3) → U431(X1, X2, X3)
U431(ok(X1), ok(X2), ok(X3)) → U431(X1, X2, X3)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U431(mark(X1), X2, X3) → U431(X1, X2, X3)
U431(ok(X1), ok(X2), ok(X3)) → U431(X1, X2, X3)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U421(mark(X1), X2, X3) → U421(X1, X2, X3)
U421(ok(X1), ok(X2), ok(X3)) → U421(X1, X2, X3)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U421(mark(X1), X2, X3) → U421(X1, X2, X3)
U421(ok(X1), ok(X2), ok(X3)) → U421(X1, X2, X3)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U411(ok(X1), ok(X2), ok(X3)) → U411(X1, X2, X3)
U411(mark(X1), X2, X3) → U411(X1, X2, X3)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U411(ok(X1), ok(X2), ok(X3)) → U411(X1, X2, X3)
U411(mark(X1), X2, X3) → U411(X1, X2, X3)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U331(ok(X)) → U331(X)
U331(mark(X)) → U331(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U331(ok(X)) → U331(X)
U331(mark(X)) → U331(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U321(ok(X1), ok(X2)) → U321(X1, X2)
U321(mark(X1), X2) → U321(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U321(ok(X1), ok(X2)) → U321(X1, X2)
U321(mark(X1), X2) → U321(X1, X2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U311(mark(X1), X2) → U311(X1, X2)
U311(ok(X1), ok(X2)) → U311(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U311(mark(X1), X2) → U311(X1, X2)
U311(ok(X1), ok(X2)) → U311(X1, X2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U231(ok(X)) → U231(X)
U231(mark(X)) → U231(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U231(ok(X)) → U231(X)
U231(mark(X)) → U231(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U221(mark(X1), X2) → U221(X1, X2)
U221(ok(X1), ok(X2)) → U221(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U221(mark(X1), X2) → U221(X1, X2)
U221(ok(X1), ok(X2)) → U221(X1, X2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U211(ok(X1), ok(X2)) → U211(X1, X2)
U211(mark(X1), X2) → U211(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U211(ok(X1), ok(X2)) → U211(X1, X2)
U211(mark(X1), X2) → U211(X1, X2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U131(ok(X)) → U131(X)
U131(mark(X)) → U131(X)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U131(ok(X)) → U131(X)
U131(mark(X)) → U131(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U121(mark(X1), X2) → U121(X1, X2)
U121(ok(X1), ok(X2)) → U121(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U121(mark(X1), X2) → U121(X1, X2)
U121(ok(X1), ok(X2)) → U121(X1, X2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U111(mark(X1), X2) → U111(X1, X2)
U111(ok(X1), ok(X2)) → U111(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U111(ok(X1), ok(X2)) → U111(X1, X2)
U111(mark(X1), X2) → U111(X1, X2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS(mark(X1), X2) → CONS(X1, X2)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

CONS(mark(X1), X2) → CONS(X1, X2)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(U91(X1, X2, X3)) → PROPER(X1)
PROPER(U51(X1, X2)) → PROPER(X2)
PROPER(U44(X1, X2, X3)) → PROPER(X1)
PROPER(U32(X1, X2)) → PROPER(X2)
PROPER(U23(X)) → PROPER(X)
PROPER(U86(X)) → PROPER(X)
PROPER(U13(X)) → PROPER(X)
PROPER(isNatList(X)) → PROPER(X)
PROPER(U85(X1, X2)) → PROPER(X2)
PROPER(U31(X1, X2)) → PROPER(X1)
PROPER(U45(X1, X2)) → PROPER(X2)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(U84(X1, X2, X3)) → PROPER(X3)
PROPER(U12(X1, X2)) → PROPER(X1)
PROPER(U81(X1, X2, X3)) → PROPER(X3)
PROPER(U84(X1, X2, X3)) → PROPER(X2)
PROPER(U41(X1, X2, X3)) → PROPER(X1)
PROPER(U42(X1, X2, X3)) → PROPER(X3)
PROPER(U21(X1, X2)) → PROPER(X1)
PROPER(U11(X1, X2)) → PROPER(X2)
PROPER(length(X)) → PROPER(X)
PROPER(U41(X1, X2, X3)) → PROPER(X3)
PROPER(U32(X1, X2)) → PROPER(X1)
PROPER(U12(X1, X2)) → PROPER(X2)
PROPER(U83(X1, X2, X3)) → PROPER(X3)
PROPER(U82(X1, X2, X3)) → PROPER(X2)
PROPER(U93(X1, X2, X3)) → PROPER(X2)
PROPER(U92(X1, X2, X3)) → PROPER(X2)
PROPER(U46(X)) → PROPER(X)
PROPER(isNatIListKind(X)) → PROPER(X)
PROPER(U52(X)) → PROPER(X)
PROPER(U83(X1, X2, X3)) → PROPER(X1)
PROPER(U42(X1, X2, X3)) → PROPER(X2)
PROPER(U41(X1, X2, X3)) → PROPER(X2)
PROPER(U22(X1, X2)) → PROPER(X2)
PROPER(U92(X1, X2, X3)) → PROPER(X1)
PROPER(U94(X1, X2)) → PROPER(X2)
PROPER(U92(X1, X2, X3)) → PROPER(X3)
PROPER(U61(X)) → PROPER(X)
PROPER(isNat(X)) → PROPER(X)
PROPER(U44(X1, X2, X3)) → PROPER(X3)
PROPER(U93(X1, X2, X3)) → PROPER(X1)
PROPER(isNatIList(X)) → PROPER(X)
PROPER(U44(X1, X2, X3)) → PROPER(X2)
PROPER(U82(X1, X2, X3)) → PROPER(X1)
PROPER(s(X)) → PROPER(X)
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(isNatKind(X)) → PROPER(X)
PROPER(U91(X1, X2, X3)) → PROPER(X3)
PROPER(U45(X1, X2)) → PROPER(X1)
PROPER(U43(X1, X2, X3)) → PROPER(X3)
PROPER(U31(X1, X2)) → PROPER(X2)
PROPER(U43(X1, X2, X3)) → PROPER(X1)
PROPER(U43(X1, X2, X3)) → PROPER(X2)
PROPER(U93(X1, X2, X3)) → PROPER(X3)
PROPER(U81(X1, X2, X3)) → PROPER(X2)
PROPER(U82(X1, X2, X3)) → PROPER(X3)
PROPER(U84(X1, X2, X3)) → PROPER(X1)
PROPER(U42(X1, X2, X3)) → PROPER(X1)
PROPER(U71(X)) → PROPER(X)
PROPER(U81(X1, X2, X3)) → PROPER(X1)
PROPER(U85(X1, X2)) → PROPER(X1)
PROPER(U51(X1, X2)) → PROPER(X1)
PROPER(U33(X)) → PROPER(X)
PROPER(U21(X1, X2)) → PROPER(X2)
PROPER(U91(X1, X2, X3)) → PROPER(X2)
PROPER(U83(X1, X2, X3)) → PROPER(X2)
PROPER(U22(X1, X2)) → PROPER(X1)
PROPER(U11(X1, X2)) → PROPER(X1)
PROPER(U94(X1, X2)) → PROPER(X1)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER(U91(X1, X2, X3)) → PROPER(X1)
PROPER(U51(X1, X2)) → PROPER(X2)
PROPER(U44(X1, X2, X3)) → PROPER(X1)
PROPER(U32(X1, X2)) → PROPER(X2)
PROPER(U23(X)) → PROPER(X)
PROPER(U86(X)) → PROPER(X)
PROPER(U13(X)) → PROPER(X)
PROPER(isNatList(X)) → PROPER(X)
PROPER(U85(X1, X2)) → PROPER(X2)
PROPER(U31(X1, X2)) → PROPER(X1)
PROPER(U45(X1, X2)) → PROPER(X2)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(U84(X1, X2, X3)) → PROPER(X3)
PROPER(U12(X1, X2)) → PROPER(X1)
PROPER(U81(X1, X2, X3)) → PROPER(X3)
PROPER(U84(X1, X2, X3)) → PROPER(X2)
PROPER(U42(X1, X2, X3)) → PROPER(X3)
PROPER(U41(X1, X2, X3)) → PROPER(X1)
PROPER(U21(X1, X2)) → PROPER(X1)
PROPER(U11(X1, X2)) → PROPER(X2)
PROPER(U12(X1, X2)) → PROPER(X2)
PROPER(U32(X1, X2)) → PROPER(X1)
PROPER(U41(X1, X2, X3)) → PROPER(X3)
PROPER(length(X)) → PROPER(X)
PROPER(U83(X1, X2, X3)) → PROPER(X3)
PROPER(U82(X1, X2, X3)) → PROPER(X2)
PROPER(U93(X1, X2, X3)) → PROPER(X2)
PROPER(U92(X1, X2, X3)) → PROPER(X2)
PROPER(U46(X)) → PROPER(X)
PROPER(isNatIListKind(X)) → PROPER(X)
PROPER(U52(X)) → PROPER(X)
PROPER(U83(X1, X2, X3)) → PROPER(X1)
PROPER(U42(X1, X2, X3)) → PROPER(X2)
PROPER(U41(X1, X2, X3)) → PROPER(X2)
PROPER(U22(X1, X2)) → PROPER(X2)
PROPER(U92(X1, X2, X3)) → PROPER(X1)
PROPER(U94(X1, X2)) → PROPER(X2)
PROPER(U92(X1, X2, X3)) → PROPER(X3)
PROPER(U61(X)) → PROPER(X)
PROPER(isNat(X)) → PROPER(X)
PROPER(U44(X1, X2, X3)) → PROPER(X3)
PROPER(U93(X1, X2, X3)) → PROPER(X1)
PROPER(isNatIList(X)) → PROPER(X)
PROPER(U44(X1, X2, X3)) → PROPER(X2)
PROPER(U82(X1, X2, X3)) → PROPER(X1)
PROPER(s(X)) → PROPER(X)
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(isNatKind(X)) → PROPER(X)
PROPER(U45(X1, X2)) → PROPER(X1)
PROPER(U91(X1, X2, X3)) → PROPER(X3)
PROPER(U43(X1, X2, X3)) → PROPER(X3)
PROPER(U43(X1, X2, X3)) → PROPER(X1)
PROPER(U31(X1, X2)) → PROPER(X2)
PROPER(U43(X1, X2, X3)) → PROPER(X2)
PROPER(U93(X1, X2, X3)) → PROPER(X3)
PROPER(U82(X1, X2, X3)) → PROPER(X3)
PROPER(U81(X1, X2, X3)) → PROPER(X2)
PROPER(U84(X1, X2, X3)) → PROPER(X1)
PROPER(U42(X1, X2, X3)) → PROPER(X1)
PROPER(U81(X1, X2, X3)) → PROPER(X1)
PROPER(U71(X)) → PROPER(X)
PROPER(U85(X1, X2)) → PROPER(X1)
PROPER(U51(X1, X2)) → PROPER(X1)
PROPER(U33(X)) → PROPER(X)
PROPER(U21(X1, X2)) → PROPER(X2)
PROPER(U22(X1, X2)) → PROPER(X1)
PROPER(U83(X1, X2, X3)) → PROPER(X2)
PROPER(U91(X1, X2, X3)) → PROPER(X2)
PROPER(U11(X1, X2)) → PROPER(X1)
PROPER(U94(X1, X2)) → PROPER(X1)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(U51(X1, X2)) → ACTIVE(X1)
ACTIVE(U21(X1, X2)) → ACTIVE(X1)
ACTIVE(U71(X)) → ACTIVE(X)
ACTIVE(U13(X)) → ACTIVE(X)
ACTIVE(length(X)) → ACTIVE(X)
ACTIVE(U43(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U81(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U83(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U93(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U94(X1, X2)) → ACTIVE(X1)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(U91(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(U42(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U23(X)) → ACTIVE(X)
ACTIVE(U41(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U22(X1, X2)) → ACTIVE(X1)
ACTIVE(U32(X1, X2)) → ACTIVE(X1)
ACTIVE(U61(X)) → ACTIVE(X)
ACTIVE(U11(X1, X2)) → ACTIVE(X1)
ACTIVE(U44(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(U33(X)) → ACTIVE(X)
ACTIVE(U45(X1, X2)) → ACTIVE(X1)
ACTIVE(U92(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U12(X1, X2)) → ACTIVE(X1)
ACTIVE(U46(X)) → ACTIVE(X)
ACTIVE(U84(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U86(X)) → ACTIVE(X)
ACTIVE(U52(X)) → ACTIVE(X)
ACTIVE(U85(X1, X2)) → ACTIVE(X1)
ACTIVE(U82(X1, X2, X3)) → ACTIVE(X1)

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesProof
QDP
                ↳ QDPSizeChangeProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(U51(X1, X2)) → ACTIVE(X1)
ACTIVE(U21(X1, X2)) → ACTIVE(X1)
ACTIVE(U71(X)) → ACTIVE(X)
ACTIVE(U13(X)) → ACTIVE(X)
ACTIVE(U43(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(length(X)) → ACTIVE(X)
ACTIVE(U83(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U81(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U93(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U94(X1, X2)) → ACTIVE(X1)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(U91(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(U42(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U23(X)) → ACTIVE(X)
ACTIVE(U41(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U22(X1, X2)) → ACTIVE(X1)
ACTIVE(U32(X1, X2)) → ACTIVE(X1)
ACTIVE(U61(X)) → ACTIVE(X)
ACTIVE(U11(X1, X2)) → ACTIVE(X1)
ACTIVE(U44(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(U33(X)) → ACTIVE(X)
ACTIVE(U45(X1, X2)) → ACTIVE(X1)
ACTIVE(U92(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U12(X1, X2)) → ACTIVE(X1)
ACTIVE(U46(X)) → ACTIVE(X)
ACTIVE(U84(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U86(X)) → ACTIVE(X)
ACTIVE(U85(X1, X2)) → ACTIVE(X1)
ACTIVE(U52(X)) → ACTIVE(X)
ACTIVE(U82(X1, X2, X3)) → ACTIVE(X1)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
QDP
            ↳ UsableRulesReductionPairsProof

Q DP problem:
The TRS P consists of the following rules:

TOP(mark(X)) → TOP(proper(X))
TOP(ok(X)) → TOP(active(X))

The TRS R consists of the following rules:

active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X1), X2) → mark(U12(X1, X2))
U13(mark(X)) → mark(U13(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U33(mark(X)) → mark(U33(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(mark(X1), X2) → mark(U45(X1, X2))
U46(mark(X)) → mark(U46(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X)) → mark(U61(X))
U71(mark(X)) → mark(U71(X))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(mark(X)) → mark(U86(X))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U13(ok(X)) → ok(U13(X))
isNatList(ok(X)) → ok(isNatList(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
isNatKind(ok(X)) → ok(isNatKind(X))
U23(ok(X)) → ok(U23(X))
isNat(ok(X)) → ok(isNat(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U33(ok(X)) → ok(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U46(ok(X)) → ok(U46(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
U61(ok(X)) → ok(U61(X))
U71(ok(X)) → ok(U71(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the usable rules with reduction pair processor [15] with a polynomial ordering [25], all dependency pairs and the corresponding usable rules [17] can be oriented non-strictly. All non-usable rules are removed, and those dependency pairs and usable rules that have been oriented strictly or contain non-usable symbols in their left-hand side are removed as well.

No dependency pairs are removed.

No rules are removed from R.

Used ordering: POLO with Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = x1 + 2·x2   
POL(U12(x1, x2)) = x1 + 2·x2   
POL(U13(x1)) = x1   
POL(U21(x1, x2)) = x1 + 2·x2   
POL(U22(x1, x2)) = x1 + 2·x2   
POL(U23(x1)) = x1   
POL(U31(x1, x2)) = x1 + 2·x2   
POL(U32(x1, x2)) = x1 + x2   
POL(U33(x1)) = x1   
POL(U41(x1, x2, x3)) = x1 + 2·x2 + 2·x3   
POL(U42(x1, x2, x3)) = x1 + x2 + 2·x3   
POL(U43(x1, x2, x3)) = x1 + x2 + 2·x3   
POL(U44(x1, x2, x3)) = x1 + 2·x2 + x3   
POL(U45(x1, x2)) = x1 + 2·x2   
POL(U46(x1)) = x1   
POL(U51(x1, x2)) = 2·x1 + x2   
POL(U52(x1)) = x1   
POL(U61(x1)) = 2·x1   
POL(U71(x1)) = x1   
POL(U81(x1, x2, x3)) = 2·x1 + 2·x2 + 2·x3   
POL(U82(x1, x2, x3)) = x1 + x2 + 2·x3   
POL(U83(x1, x2, x3)) = x1 + 2·x2 + 2·x3   
POL(U84(x1, x2, x3)) = x1 + 2·x2 + x3   
POL(U85(x1, x2)) = 2·x1 + 2·x2   
POL(U86(x1)) = 2·x1   
POL(U91(x1, x2, x3)) = x1 + 2·x2 + x3   
POL(U92(x1, x2, x3)) = x1 + 2·x2 + 2·x3   
POL(U93(x1, x2, x3)) = 2·x1 + 2·x2 + 2·x3   
POL(U94(x1, x2)) = 2·x1 + 2·x2   
POL(active(x1)) = 2·x1   
POL(cons(x1, x2)) = 2·x1 + 2·x2   
POL(isNat(x1)) = x1   
POL(isNatIList(x1)) = 2·x1   
POL(isNatIListKind(x1)) = 2·x1   
POL(isNatKind(x1)) = 2·x1   
POL(isNatList(x1)) = 2·x1   
POL(length(x1)) = 2·x1   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = 2·x1   
POL(proper(x1)) = x1   
POL(s(x1)) = 2·x1   
POL(tt) = 0   
POL(zeros) = 0   



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
QDP
                ↳ Narrowing

Q DP problem:
The TRS P consists of the following rules:

TOP(mark(X)) → TOP(proper(X))
TOP(ok(X)) → TOP(active(X))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule TOP(mark(X)) → TOP(proper(X)) at position [0] we obtained the following new rules:

TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(mark(tt)) → TOP(ok(tt))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(nil)) → TOP(ok(nil))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(zeros)) → TOP(ok(zeros))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(0)) → TOP(ok(0))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
QDP
                    ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(mark(tt)) → TOP(ok(tt))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(nil)) → TOP(ok(nil))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(X)) → TOP(active(X))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(zeros)) → TOP(ok(zeros))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(0)) → TOP(ok(0))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
QDP
                        ↳ Narrowing

Q DP problem:
The TRS P consists of the following rules:

TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(mark(tt)) → TOP(ok(tt))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(X)) → TOP(active(X))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(0)) → TOP(ok(0))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule TOP(ok(X)) → TOP(active(X)) at position [0] we obtained the following new rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(ok(U23(tt))) → TOP(mark(tt))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(ok(isNatIListKind(cons(x0, x1)))) → TOP(mark(U51(isNatKind(x0), x1)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(ok(isNatIListKind(zeros))) → TOP(mark(tt))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(isNatIListKind(nil))) → TOP(mark(tt))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(zeros)) → TOP(mark(cons(0, zeros)))
TOP(ok(isNat(length(x0)))) → TOP(mark(U11(isNatIListKind(x0), x0)))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(isNatKind(s(x0)))) → TOP(mark(U71(isNatKind(x0))))
TOP(ok(U86(tt))) → TOP(mark(tt))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(ok(U83(tt, x0, x1))) → TOP(mark(U84(isNatIListKind(x1), x0, x1)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(ok(isNatList(nil))) → TOP(mark(tt))
TOP(ok(isNat(0))) → TOP(mark(tt))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(ok(isNatKind(0))) → TOP(mark(tt))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(ok(U46(tt))) → TOP(mark(tt))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(U61(tt))) → TOP(mark(tt))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(isNatList(cons(x0, x1)))) → TOP(mark(U81(isNatKind(x0), x0, x1)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U71(tt))) → TOP(mark(tt))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(isNatIList(cons(x0, x1)))) → TOP(mark(U41(isNatKind(x0), x0, x1)))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U33(tt))) → TOP(mark(tt))
TOP(ok(U42(tt, x0, x1))) → TOP(mark(U43(isNatIListKind(x1), x0, x1)))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(length(cons(x0, x1)))) → TOP(mark(U91(isNatList(x1), x1, x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(ok(isNatKind(length(x0)))) → TOP(mark(U61(isNatIListKind(x0))))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(ok(U52(tt))) → TOP(mark(tt))
TOP(ok(U31(tt, x0))) → TOP(mark(U32(isNatIListKind(x0), x0)))
TOP(ok(U13(tt))) → TOP(mark(tt))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(ok(U41(tt, x0, x1))) → TOP(mark(U42(isNatKind(x0), x0, x1)))
TOP(ok(isNatIList(x0))) → TOP(mark(U31(isNatIListKind(x0), x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(ok(length(nil))) → TOP(mark(0))
TOP(ok(isNatIList(zeros))) → TOP(mark(tt))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))
TOP(ok(isNat(s(x0)))) → TOP(mark(U21(isNatKind(x0), x0)))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
QDP
                            ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U23(tt))) → TOP(mark(tt))
TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(isNatIListKind(cons(x0, x1)))) → TOP(mark(U51(isNatKind(x0), x1)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(zeros)) → TOP(mark(cons(0, zeros)))
TOP(ok(isNat(length(x0)))) → TOP(mark(U11(isNatIListKind(x0), x0)))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(isNatKind(s(x0)))) → TOP(mark(U71(isNatKind(x0))))
TOP(ok(U86(tt))) → TOP(mark(tt))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(ok(U83(tt, x0, x1))) → TOP(mark(U84(isNatIListKind(x1), x0, x1)))
TOP(ok(isNatList(nil))) → TOP(mark(tt))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(isNatList(cons(x0, x1)))) → TOP(mark(U81(isNatKind(x0), x0, x1)))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(isNatIList(cons(x0, x1)))) → TOP(mark(U41(isNatKind(x0), x0, x1)))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U42(tt, x0, x1))) → TOP(mark(U43(isNatIListKind(x1), x0, x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(mark(tt)) → TOP(ok(tt))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(ok(isNatKind(length(x0)))) → TOP(mark(U61(isNatIListKind(x0))))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(ok(U52(tt))) → TOP(mark(tt))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(ok(isNatIList(x0))) → TOP(mark(U31(isNatIListKind(x0), x0)))
TOP(ok(U41(tt, x0, x1))) → TOP(mark(U42(isNatKind(x0), x0, x1)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(isNatIList(zeros))) → TOP(mark(tt))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(isNat(s(x0)))) → TOP(mark(U21(isNatKind(x0), x0)))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(ok(isNatIListKind(zeros))) → TOP(mark(tt))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(isNatIListKind(nil))) → TOP(mark(tt))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(isNat(0))) → TOP(mark(tt))
TOP(ok(isNatKind(0))) → TOP(mark(tt))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(0)) → TOP(ok(0))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(ok(U46(tt))) → TOP(mark(tt))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(U61(tt))) → TOP(mark(tt))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U71(tt))) → TOP(mark(tt))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U33(tt))) → TOP(mark(tt))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(length(cons(x0, x1)))) → TOP(mark(U91(isNatList(x1), x1, x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(ok(U31(tt, x0))) → TOP(mark(U32(isNatIListKind(x0), x0)))
TOP(ok(U13(tt))) → TOP(mark(tt))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(length(nil))) → TOP(mark(0))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 17 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
QDP
                                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(isNatIListKind(cons(x0, x1)))) → TOP(mark(U51(isNatKind(x0), x1)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(zeros)) → TOP(mark(cons(0, zeros)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(isNat(length(x0)))) → TOP(mark(U11(isNatIListKind(x0), x0)))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(isNatKind(s(x0)))) → TOP(mark(U71(isNatKind(x0))))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(ok(U83(tt, x0, x1))) → TOP(mark(U84(isNatIListKind(x1), x0, x1)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(isNatList(cons(x0, x1)))) → TOP(mark(U81(isNatKind(x0), x0, x1)))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(isNatIList(cons(x0, x1)))) → TOP(mark(U41(isNatKind(x0), x0, x1)))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U42(tt, x0, x1))) → TOP(mark(U43(isNatIListKind(x1), x0, x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(ok(isNatKind(length(x0)))) → TOP(mark(U61(isNatIListKind(x0))))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(ok(U41(tt, x0, x1))) → TOP(mark(U42(isNatKind(x0), x0, x1)))
TOP(ok(isNatIList(x0))) → TOP(mark(U31(isNatIListKind(x0), x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(isNat(s(x0)))) → TOP(mark(U21(isNatKind(x0), x0)))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(length(cons(x0, x1)))) → TOP(mark(U91(isNatList(x1), x1, x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(ok(U31(tt, x0))) → TOP(mark(U32(isNatIListKind(x0), x0)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(zeros)) → TOP(mark(cons(0, zeros)))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(isNatIListKind(cons(x0, x1)))) → TOP(mark(U51(isNatKind(x0), x1)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(isNat(length(x0)))) → TOP(mark(U11(isNatIListKind(x0), x0)))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(isNatKind(s(x0)))) → TOP(mark(U71(isNatKind(x0))))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(ok(U83(tt, x0, x1))) → TOP(mark(U84(isNatIListKind(x1), x0, x1)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(isNatList(cons(x0, x1)))) → TOP(mark(U81(isNatKind(x0), x0, x1)))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(isNatIList(cons(x0, x1)))) → TOP(mark(U41(isNatKind(x0), x0, x1)))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U42(tt, x0, x1))) → TOP(mark(U43(isNatIListKind(x1), x0, x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(ok(isNatKind(length(x0)))) → TOP(mark(U61(isNatIListKind(x0))))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(ok(U41(tt, x0, x1))) → TOP(mark(U42(isNatKind(x0), x0, x1)))
TOP(ok(isNatIList(x0))) → TOP(mark(U31(isNatIListKind(x0), x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(isNat(s(x0)))) → TOP(mark(U21(isNatKind(x0), x0)))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(length(cons(x0, x1)))) → TOP(mark(U91(isNatList(x1), x1, x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(ok(U31(tt, x0))) → TOP(mark(U32(isNatIListKind(x0), x0)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 1   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = 0   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 1   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
QDP
                                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(isNatIListKind(cons(x0, x1)))) → TOP(mark(U51(isNatKind(x0), x1)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(isNat(length(x0)))) → TOP(mark(U11(isNatIListKind(x0), x0)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(isNatKind(s(x0)))) → TOP(mark(U71(isNatKind(x0))))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(ok(U83(tt, x0, x1))) → TOP(mark(U84(isNatIListKind(x1), x0, x1)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(isNatList(cons(x0, x1)))) → TOP(mark(U81(isNatKind(x0), x0, x1)))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(isNatIList(cons(x0, x1)))) → TOP(mark(U41(isNatKind(x0), x0, x1)))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U42(tt, x0, x1))) → TOP(mark(U43(isNatIListKind(x1), x0, x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(isNatKind(length(x0)))) → TOP(mark(U61(isNatIListKind(x0))))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(ok(isNatIList(x0))) → TOP(mark(U31(isNatIListKind(x0), x0)))
TOP(ok(U41(tt, x0, x1))) → TOP(mark(U42(isNatKind(x0), x0, x1)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(isNat(s(x0)))) → TOP(mark(U21(isNatKind(x0), x0)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(length(cons(x0, x1)))) → TOP(mark(U91(isNatList(x1), x1, x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(ok(U31(tt, x0))) → TOP(mark(U32(isNatIListKind(x0), x0)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(isNatList(cons(x0, x1)))) → TOP(mark(U81(isNatKind(x0), x0, x1)))
TOP(ok(isNatIList(cons(x0, x1)))) → TOP(mark(U41(isNatKind(x0), x0, x1)))
TOP(ok(isNatIList(x0))) → TOP(mark(U31(isNatIListKind(x0), x0)))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(isNatIListKind(cons(x0, x1)))) → TOP(mark(U51(isNatKind(x0), x1)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(isNat(length(x0)))) → TOP(mark(U11(isNatIListKind(x0), x0)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(isNatKind(s(x0)))) → TOP(mark(U71(isNatKind(x0))))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(ok(U83(tt, x0, x1))) → TOP(mark(U84(isNatIListKind(x1), x0, x1)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U42(tt, x0, x1))) → TOP(mark(U43(isNatIListKind(x1), x0, x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(isNatKind(length(x0)))) → TOP(mark(U61(isNatIListKind(x0))))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(ok(U41(tt, x0, x1))) → TOP(mark(U42(isNatKind(x0), x0, x1)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(isNat(s(x0)))) → TOP(mark(U21(isNatKind(x0), x0)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(length(cons(x0, x1)))) → TOP(mark(U91(isNatList(x1), x1, x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(ok(U31(tt, x0))) → TOP(mark(U32(isNatIListKind(x0), x0)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 1   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 1   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
QDP
                                        ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(isNatIListKind(cons(x0, x1)))) → TOP(mark(U51(isNatKind(x0), x1)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(isNat(length(x0)))) → TOP(mark(U11(isNatIListKind(x0), x0)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(isNatKind(s(x0)))) → TOP(mark(U71(isNatKind(x0))))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(ok(U83(tt, x0, x1))) → TOP(mark(U84(isNatIListKind(x1), x0, x1)))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U42(tt, x0, x1))) → TOP(mark(U43(isNatIListKind(x1), x0, x1)))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(length(cons(x0, x1)))) → TOP(mark(U91(isNatList(x1), x1, x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(ok(isNatKind(length(x0)))) → TOP(mark(U61(isNatIListKind(x0))))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U31(tt, x0))) → TOP(mark(U32(isNatIListKind(x0), x0)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U41(tt, x0, x1))) → TOP(mark(U42(isNatKind(x0), x0, x1)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(isNat(s(x0)))) → TOP(mark(U21(isNatKind(x0), x0)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(isNatIListKind(cons(x0, x1)))) → TOP(mark(U51(isNatKind(x0), x1)))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(isNat(length(x0)))) → TOP(mark(U11(isNatIListKind(x0), x0)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(isNatKind(s(x0)))) → TOP(mark(U71(isNatKind(x0))))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(ok(U83(tt, x0, x1))) → TOP(mark(U84(isNatIListKind(x1), x0, x1)))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U42(tt, x0, x1))) → TOP(mark(U43(isNatIListKind(x1), x0, x1)))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(length(cons(x0, x1)))) → TOP(mark(U91(isNatList(x1), x1, x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(ok(isNatKind(length(x0)))) → TOP(mark(U61(isNatIListKind(x0))))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U31(tt, x0))) → TOP(mark(U32(isNatIListKind(x0), x0)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U41(tt, x0, x1))) → TOP(mark(U42(isNatKind(x0), x0, x1)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(isNat(s(x0)))) → TOP(mark(U21(isNatKind(x0), x0)))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = x1   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 1   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = x1   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U23(tt)) → mark(tt)
active(U33(tt)) → mark(tt)
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U13(tt)) → mark(tt)
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(zeros) → mark(cons(0, zeros))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(length(nil)) → mark(0)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(isNatList(nil)) → mark(tt)
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(0)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(nil)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(0)) → mark(tt)
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
active(U11(X1, X2)) → U11(active(X1), X2)
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
proper(U46(X)) → U46(proper(X))
active(U13(X)) → U13(active(X))
proper(isNatIList(X)) → isNatIList(proper(X))
active(U12(X1, X2)) → U12(active(X1), X2)
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
active(U22(X1, X2)) → U22(active(X1), X2)
proper(U52(X)) → U52(proper(X))
active(U21(X1, X2)) → U21(active(X1), X2)
proper(U61(X)) → U61(proper(X))
active(U31(X1, X2)) → U31(active(X1), X2)
proper(U71(X)) → U71(proper(X))
active(U23(X)) → U23(active(X))
proper(U23(X)) → U23(proper(X))
active(U33(X)) → U33(active(X))
proper(isNat(X)) → isNat(proper(X))
active(U32(X1, X2)) → U32(active(X1), X2)
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
proper(U33(X)) → U33(proper(X))
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
active(U46(X)) → U46(active(X))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
active(U45(X1, X2)) → U45(active(X1), X2)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
proper(tt) → ok(tt)
active(U52(X)) → U52(active(X))
proper(U13(X)) → U13(proper(X))
active(U61(X)) → U61(active(X))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
active(U71(X)) → U71(active(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
proper(isNatList(X)) → isNatList(proper(X))
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
proper(isNatKind(X)) → isNatKind(proper(X))
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
proper(zeros) → ok(zeros)
active(U94(X1, X2)) → U94(active(X1), X2)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
active(s(X)) → s(active(X))
proper(0) → ok(0)
active(length(X)) → length(active(X))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
QDP
                                            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(isNat(length(x0)))) → TOP(mark(U11(isNatIListKind(x0), x0)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(isNatKind(s(x0)))) → TOP(mark(U71(isNatKind(x0))))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(ok(U83(tt, x0, x1))) → TOP(mark(U84(isNatIListKind(x1), x0, x1)))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U42(tt, x0, x1))) → TOP(mark(U43(isNatIListKind(x1), x0, x1)))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(length(cons(x0, x1)))) → TOP(mark(U91(isNatList(x1), x1, x0)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(ok(isNatKind(length(x0)))) → TOP(mark(U61(isNatIListKind(x0))))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U31(tt, x0))) → TOP(mark(U32(isNatIListKind(x0), x0)))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(ok(U41(tt, x0, x1))) → TOP(mark(U42(isNatKind(x0), x0, x1)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))
TOP(ok(isNat(s(x0)))) → TOP(mark(U21(isNatKind(x0), x0)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(U41(tt, x0, x1))) → TOP(mark(U42(isNatKind(x0), x0, x1)))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(isNat(length(x0)))) → TOP(mark(U11(isNatIListKind(x0), x0)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(isNatKind(s(x0)))) → TOP(mark(U71(isNatKind(x0))))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(ok(U83(tt, x0, x1))) → TOP(mark(U84(isNatIListKind(x1), x0, x1)))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U42(tt, x0, x1))) → TOP(mark(U43(isNatIListKind(x1), x0, x1)))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(length(cons(x0, x1)))) → TOP(mark(U91(isNatList(x1), x1, x0)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(ok(isNatKind(length(x0)))) → TOP(mark(U61(isNatIListKind(x0))))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U31(tt, x0))) → TOP(mark(U32(isNatIListKind(x0), x0)))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))
TOP(ok(isNat(s(x0)))) → TOP(mark(U21(isNatKind(x0), x0)))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 1   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
QDP
                                                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(isNat(length(x0)))) → TOP(mark(U11(isNatIListKind(x0), x0)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(isNatKind(s(x0)))) → TOP(mark(U71(isNatKind(x0))))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(ok(U83(tt, x0, x1))) → TOP(mark(U84(isNatIListKind(x1), x0, x1)))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U42(tt, x0, x1))) → TOP(mark(U43(isNatIListKind(x1), x0, x1)))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(length(cons(x0, x1)))) → TOP(mark(U91(isNatList(x1), x1, x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(ok(isNatKind(length(x0)))) → TOP(mark(U61(isNatIListKind(x0))))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U31(tt, x0))) → TOP(mark(U32(isNatIListKind(x0), x0)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(isNat(s(x0)))) → TOP(mark(U21(isNatKind(x0), x0)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(isNat(length(x0)))) → TOP(mark(U11(isNatIListKind(x0), x0)))
TOP(ok(U83(tt, x0, x1))) → TOP(mark(U84(isNatIListKind(x1), x0, x1)))
TOP(ok(U42(tt, x0, x1))) → TOP(mark(U43(isNatIListKind(x1), x0, x1)))
TOP(ok(length(cons(x0, x1)))) → TOP(mark(U91(isNatList(x1), x1, x0)))
TOP(ok(isNatKind(length(x0)))) → TOP(mark(U61(isNatIListKind(x0))))
TOP(ok(U31(tt, x0))) → TOP(mark(U32(isNatIListKind(x0), x0)))
TOP(ok(isNat(s(x0)))) → TOP(mark(U21(isNatKind(x0), x0)))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(isNatKind(s(x0)))) → TOP(mark(U71(isNatKind(x0))))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 1   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 1   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 1   
POL(U82(x1, x2, x3)) = 1   
POL(U83(x1, x2, x3)) = 1   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 1 + x1   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = x1   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 1   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = x1   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U13(X)) → U13(proper(X))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(isNatList(X)) → isNatList(proper(X))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(zeros) → ok(zeros)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(0) → ok(0)



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
QDP
                                                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(isNatKind(s(x0)))) → TOP(mark(U71(isNatKind(x0))))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(isNatKind(s(x0)))) → TOP(mark(U71(isNatKind(x0))))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 1   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
QDP
                                                        ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(U81(tt, x0, x1))) → TOP(mark(U82(isNatKind(x0), x0, x1)))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 1   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
                                                      ↳ QDP
                                                        ↳ QDPOrderProof
QDP
                                                            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(U82(tt, x0, x1))) → TOP(mark(U83(isNatIListKind(x1), x0, x1)))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 1   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
                                                      ↳ QDP
                                                        ↳ QDPOrderProof
                                                          ↳ QDP
                                                            ↳ QDPOrderProof
QDP
                                                                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(mark(isNat(x0))) → TOP(isNat(proper(x0)))
TOP(mark(isNatIList(x0))) → TOP(isNatIList(proper(x0)))
TOP(mark(isNatKind(x0))) → TOP(isNatKind(proper(x0)))
TOP(mark(isNatIListKind(x0))) → TOP(isNatIListKind(proper(x0)))
TOP(mark(isNatList(x0))) → TOP(isNatList(proper(x0)))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 1   
POL(U12(x1, x2)) = 1   
POL(U13(x1)) = 1   
POL(U21(x1, x2)) = 1   
POL(U22(x1, x2)) = 1   
POL(U23(x1)) = 1   
POL(U31(x1, x2)) = 1   
POL(U32(x1, x2)) = 1   
POL(U33(x1)) = 1   
POL(U41(x1, x2, x3)) = 1   
POL(U42(x1, x2, x3)) = 1   
POL(U43(x1, x2, x3)) = 1   
POL(U44(x1, x2, x3)) = 1   
POL(U45(x1, x2)) = 1   
POL(U46(x1)) = 1   
POL(U51(x1, x2)) = 1   
POL(U52(x1)) = 1   
POL(U61(x1)) = 1   
POL(U71(x1)) = 1   
POL(U81(x1, x2, x3)) = 1   
POL(U82(x1, x2, x3)) = 1   
POL(U83(x1, x2, x3)) = 1   
POL(U84(x1, x2, x3)) = 1   
POL(U85(x1, x2)) = 1   
POL(U86(x1)) = 1   
POL(U91(x1, x2, x3)) = 1   
POL(U92(x1, x2, x3)) = 1   
POL(U93(x1, x2, x3)) = 1   
POL(U94(x1, x2)) = 1   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 1   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 1   
POL(mark(x1)) = 1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 1   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
                                                      ↳ QDP
                                                        ↳ QDPOrderProof
                                                          ↳ QDP
                                                            ↳ QDPOrderProof
                                                              ↳ QDP
                                                                ↳ QDPOrderProof
QDP
                                                                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(U11(tt, x0))) → TOP(mark(U12(isNatIListKind(x0), x0)))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 1   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
                                                      ↳ QDP
                                                        ↳ QDPOrderProof
                                                          ↳ QDP
                                                            ↳ QDPOrderProof
                                                              ↳ QDP
                                                                ↳ QDPOrderProof
                                                                  ↳ QDP
                                                                    ↳ QDPOrderProof
QDP
                                                                        ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(U85(tt, x0))) → TOP(mark(U86(isNatList(x0))))
TOP(ok(U21(tt, x0))) → TOP(mark(U22(isNatKind(x0), x0)))
TOP(ok(U43(tt, x0, x1))) → TOP(mark(U44(isNatIListKind(x1), x0, x1)))
TOP(ok(U94(tt, x0))) → TOP(mark(s(length(x0))))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 1   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 1   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 1   
POL(U85(x1, x2)) = 1   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 1   
POL(U92(x1, x2, x3)) = 1   
POL(U93(x1, x2, x3)) = 1   
POL(U94(x1, x2)) = 1   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
                                                      ↳ QDP
                                                        ↳ QDPOrderProof
                                                          ↳ QDP
                                                            ↳ QDPOrderProof
                                                              ↳ QDP
                                                                ↳ QDPOrderProof
                                                                  ↳ QDP
                                                                    ↳ QDPOrderProof
                                                                      ↳ QDP
                                                                        ↳ QDPOrderProof
QDP
                                                                            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(U22(tt, x0))) → TOP(mark(U23(isNat(x0))))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 1   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
                                                      ↳ QDP
                                                        ↳ QDPOrderProof
                                                          ↳ QDP
                                                            ↳ QDPOrderProof
                                                              ↳ QDP
                                                                ↳ QDPOrderProof
                                                                  ↳ QDP
                                                                    ↳ QDPOrderProof
                                                                      ↳ QDP
                                                                        ↳ QDPOrderProof
                                                                          ↳ QDP
                                                                            ↳ QDPOrderProof
QDP
                                                                                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(U12(tt, x0))) → TOP(mark(U13(isNatList(x0))))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 1   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
                                                      ↳ QDP
                                                        ↳ QDPOrderProof
                                                          ↳ QDP
                                                            ↳ QDPOrderProof
                                                              ↳ QDP
                                                                ↳ QDPOrderProof
                                                                  ↳ QDP
                                                                    ↳ QDPOrderProof
                                                                      ↳ QDP
                                                                        ↳ QDPOrderProof
                                                                          ↳ QDP
                                                                            ↳ QDPOrderProof
                                                                              ↳ QDP
                                                                                ↳ QDPOrderProof
QDP
                                                                                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(U45(tt, x0))) → TOP(mark(U46(isNatIList(x0))))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
Used ordering: Polynomial interpretation [25]:

POL(0) = 1   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = x2   
POL(U12(x1, x2)) = x2   
POL(U13(x1)) = x1   
POL(U21(x1, x2)) = 1   
POL(U22(x1, x2)) = x1   
POL(U23(x1)) = 1   
POL(U31(x1, x2)) = x2   
POL(U32(x1, x2)) = x2   
POL(U33(x1)) = x1   
POL(U41(x1, x2, x3)) = 1 + x2   
POL(U42(x1, x2, x3)) = 1 + x2   
POL(U43(x1, x2, x3)) = 1 + x2   
POL(U44(x1, x2, x3)) = 1 + x2   
POL(U45(x1, x2)) = 1 + x1   
POL(U46(x1)) = 1   
POL(U51(x1, x2)) = x1   
POL(U52(x1)) = x1   
POL(U61(x1)) = x1   
POL(U71(x1)) = x1   
POL(U81(x1, x2, x3)) = x2   
POL(U82(x1, x2, x3)) = x2   
POL(U83(x1, x2, x3)) = x2   
POL(U84(x1, x2, x3)) = x2   
POL(U85(x1, x2)) = x1   
POL(U86(x1)) = 1   
POL(U91(x1, x2, x3)) = x3   
POL(U92(x1, x2, x3)) = x3   
POL(U93(x1, x2, x3)) = x1   
POL(U94(x1, x2)) = x1   
POL(active(x1)) = x1   
POL(cons(x1, x2)) = x1   
POL(isNat(x1)) = x1   
POL(isNatIList(x1)) = 1 + x1   
POL(isNatIListKind(x1)) = 1   
POL(isNatKind(x1)) = 1   
POL(isNatList(x1)) = x1   
POL(length(x1)) = x1   
POL(mark(x1)) = x1   
POL(nil) = 1   
POL(ok(x1)) = x1   
POL(proper(x1)) = x1   
POL(s(x1)) = 1   
POL(tt) = 1   
POL(zeros) = 1   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U23(tt)) → mark(tt)
active(U33(tt)) → mark(tt)
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U13(tt)) → mark(tt)
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(zeros) → mark(cons(0, zeros))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(length(nil)) → mark(0)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(isNatList(nil)) → mark(tt)
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(0)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(nil)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(0)) → mark(tt)
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
active(U11(X1, X2)) → U11(active(X1), X2)
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
active(cons(X1, X2)) → cons(active(X1), X2)
proper(U46(X)) → U46(proper(X))
active(U13(X)) → U13(active(X))
proper(isNatIList(X)) → isNatIList(proper(X))
active(U12(X1, X2)) → U12(active(X1), X2)
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
active(U22(X1, X2)) → U22(active(X1), X2)
proper(U52(X)) → U52(proper(X))
active(U21(X1, X2)) → U21(active(X1), X2)
proper(U61(X)) → U61(proper(X))
active(U31(X1, X2)) → U31(active(X1), X2)
proper(U71(X)) → U71(proper(X))
active(U23(X)) → U23(active(X))
proper(U23(X)) → U23(proper(X))
active(U33(X)) → U33(active(X))
proper(isNat(X)) → isNat(proper(X))
active(U32(X1, X2)) → U32(active(X1), X2)
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
proper(U33(X)) → U33(proper(X))
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
active(U46(X)) → U46(active(X))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
active(U45(X1, X2)) → U45(active(X1), X2)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
active(U51(X1, X2)) → U51(active(X1), X2)
proper(tt) → ok(tt)
active(U52(X)) → U52(active(X))
proper(U13(X)) → U13(proper(X))
active(U61(X)) → U61(active(X))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
active(U71(X)) → U71(active(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
proper(isNatList(X)) → isNatList(proper(X))
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
proper(isNatKind(X)) → isNatKind(proper(X))
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
proper(zeros) → ok(zeros)
active(U94(X1, X2)) → U94(active(X1), X2)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
active(s(X)) → s(active(X))
proper(0) → ok(0)
active(length(X)) → length(active(X))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
                                                      ↳ QDP
                                                        ↳ QDPOrderProof
                                                          ↳ QDP
                                                            ↳ QDPOrderProof
                                                              ↳ QDP
                                                                ↳ QDPOrderProof
                                                                  ↳ QDP
                                                                    ↳ QDPOrderProof
                                                                      ↳ QDP
                                                                        ↳ QDPOrderProof
                                                                          ↳ QDP
                                                                            ↳ QDPOrderProof
                                                                              ↳ QDP
                                                                                ↳ QDPOrderProof
                                                                                  ↳ QDP
                                                                                    ↳ QDPOrderProof
QDP
                                                                                        ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(U44(tt, x0, x1))) → TOP(mark(U45(isNat(x0), x1)))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 1   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
                                                      ↳ QDP
                                                        ↳ QDPOrderProof
                                                          ↳ QDP
                                                            ↳ QDPOrderProof
                                                              ↳ QDP
                                                                ↳ QDPOrderProof
                                                                  ↳ QDP
                                                                    ↳ QDPOrderProof
                                                                      ↳ QDP
                                                                        ↳ QDPOrderProof
                                                                          ↳ QDP
                                                                            ↳ QDPOrderProof
                                                                              ↳ QDP
                                                                                ↳ QDPOrderProof
                                                                                  ↳ QDP
                                                                                    ↳ QDPOrderProof
                                                                                      ↳ QDP
                                                                                        ↳ QDPOrderProof
QDP
                                                                                            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(U32(tt, x0))) → TOP(mark(U33(isNatList(x0))))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 1   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
                                                      ↳ QDP
                                                        ↳ QDPOrderProof
                                                          ↳ QDP
                                                            ↳ QDPOrderProof
                                                              ↳ QDP
                                                                ↳ QDPOrderProof
                                                                  ↳ QDP
                                                                    ↳ QDPOrderProof
                                                                      ↳ QDP
                                                                        ↳ QDPOrderProof
                                                                          ↳ QDP
                                                                            ↳ QDPOrderProof
                                                                              ↳ QDP
                                                                                ↳ QDPOrderProof
                                                                                  ↳ QDP
                                                                                    ↳ QDPOrderProof
                                                                                      ↳ QDP
                                                                                        ↳ QDPOrderProof
                                                                                          ↳ QDP
                                                                                            ↳ QDPOrderProof
QDP
                                                                                                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(U91(tt, x0, x1))) → TOP(mark(U92(isNatIListKind(x0), x0, x1)))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 1   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
                                                      ↳ QDP
                                                        ↳ QDPOrderProof
                                                          ↳ QDP
                                                            ↳ QDPOrderProof
                                                              ↳ QDP
                                                                ↳ QDPOrderProof
                                                                  ↳ QDP
                                                                    ↳ QDPOrderProof
                                                                      ↳ QDP
                                                                        ↳ QDPOrderProof
                                                                          ↳ QDP
                                                                            ↳ QDPOrderProof
                                                                              ↳ QDP
                                                                                ↳ QDPOrderProof
                                                                                  ↳ QDP
                                                                                    ↳ QDPOrderProof
                                                                                      ↳ QDP
                                                                                        ↳ QDPOrderProof
                                                                                          ↳ QDP
                                                                                            ↳ QDPOrderProof
                                                                                              ↳ QDP
                                                                                                ↳ QDPOrderProof
QDP
                                                                                                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(U84(tt, x0, x1))) → TOP(mark(U85(isNat(x0), x1)))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 1   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
                                                      ↳ QDP
                                                        ↳ QDPOrderProof
                                                          ↳ QDP
                                                            ↳ QDPOrderProof
                                                              ↳ QDP
                                                                ↳ QDPOrderProof
                                                                  ↳ QDP
                                                                    ↳ QDPOrderProof
                                                                      ↳ QDP
                                                                        ↳ QDPOrderProof
                                                                          ↳ QDP
                                                                            ↳ QDPOrderProof
                                                                              ↳ QDP
                                                                                ↳ QDPOrderProof
                                                                                  ↳ QDP
                                                                                    ↳ QDPOrderProof
                                                                                      ↳ QDP
                                                                                        ↳ QDPOrderProof
                                                                                          ↳ QDP
                                                                                            ↳ QDPOrderProof
                                                                                              ↳ QDP
                                                                                                ↳ QDPOrderProof
                                                                                                  ↳ QDP
                                                                                                    ↳ QDPOrderProof
QDP
                                                                                                        ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(U51(tt, x0))) → TOP(mark(U52(isNatIListKind(x0))))
TOP(ok(U92(tt, x0, x1))) → TOP(mark(U93(isNat(x1), x0, x1)))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 1   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 1   
POL(U93(x1, x2, x3)) = 0   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
                                                      ↳ QDP
                                                        ↳ QDPOrderProof
                                                          ↳ QDP
                                                            ↳ QDPOrderProof
                                                              ↳ QDP
                                                                ↳ QDPOrderProof
                                                                  ↳ QDP
                                                                    ↳ QDPOrderProof
                                                                      ↳ QDP
                                                                        ↳ QDPOrderProof
                                                                          ↳ QDP
                                                                            ↳ QDPOrderProof
                                                                              ↳ QDP
                                                                                ↳ QDPOrderProof
                                                                                  ↳ QDP
                                                                                    ↳ QDPOrderProof
                                                                                      ↳ QDP
                                                                                        ↳ QDPOrderProof
                                                                                          ↳ QDP
                                                                                            ↳ QDPOrderProof
                                                                                              ↳ QDP
                                                                                                ↳ QDPOrderProof
                                                                                                  ↳ QDP
                                                                                                    ↳ QDPOrderProof
                                                                                                      ↳ QDP
                                                                                                        ↳ QDPOrderProof
QDP
                                                                                                            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].


The following pairs can be oriented strictly and are deleted.


TOP(ok(U93(tt, x0, x1))) → TOP(mark(U94(isNatKind(x1), x0)))
The remaining pairs can at least be oriented weakly.

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
Used ordering: Polynomial interpretation [25]:

POL(0) = 0   
POL(TOP(x1)) = x1   
POL(U11(x1, x2)) = 0   
POL(U12(x1, x2)) = 0   
POL(U13(x1)) = 0   
POL(U21(x1, x2)) = 0   
POL(U22(x1, x2)) = 0   
POL(U23(x1)) = 0   
POL(U31(x1, x2)) = 0   
POL(U32(x1, x2)) = 0   
POL(U33(x1)) = 0   
POL(U41(x1, x2, x3)) = 0   
POL(U42(x1, x2, x3)) = 0   
POL(U43(x1, x2, x3)) = 0   
POL(U44(x1, x2, x3)) = 0   
POL(U45(x1, x2)) = 0   
POL(U46(x1)) = 0   
POL(U51(x1, x2)) = 0   
POL(U52(x1)) = 0   
POL(U61(x1)) = 0   
POL(U71(x1)) = 0   
POL(U81(x1, x2, x3)) = 0   
POL(U82(x1, x2, x3)) = 0   
POL(U83(x1, x2, x3)) = 0   
POL(U84(x1, x2, x3)) = 0   
POL(U85(x1, x2)) = 0   
POL(U86(x1)) = 0   
POL(U91(x1, x2, x3)) = 0   
POL(U92(x1, x2, x3)) = 0   
POL(U93(x1, x2, x3)) = 1   
POL(U94(x1, x2)) = 0   
POL(active(x1)) = 0   
POL(cons(x1, x2)) = 0   
POL(isNat(x1)) = 0   
POL(isNatIList(x1)) = 0   
POL(isNatIListKind(x1)) = 0   
POL(isNatKind(x1)) = 0   
POL(isNatList(x1)) = 0   
POL(length(x1)) = 0   
POL(mark(x1)) = x1   
POL(nil) = 0   
POL(ok(x1)) = x1   
POL(proper(x1)) = 0   
POL(s(x1)) = 0   
POL(tt) = 0   
POL(zeros) = 0   

The following usable rules [17] were oriented:

U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
U86(mark(X)) → mark(U86(X))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U85(mark(X1), X2) → mark(U85(X1, X2))
U86(ok(X)) → ok(U86(X))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U94(mark(X1), X2) → mark(U94(X1, X2))
s(ok(X)) → ok(s(X))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U33(ok(X)) → ok(U33(X))
U33(mark(X)) → mark(U33(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U32(mark(X1), X2) → mark(U32(X1, X2))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U45(mark(X1), X2) → mark(U45(X1, X2))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ UsableRulesReductionPairsProof
              ↳ QDP
                ↳ Narrowing
                  ↳ QDP
                    ↳ DependencyGraphProof
                      ↳ QDP
                        ↳ Narrowing
                          ↳ QDP
                            ↳ DependencyGraphProof
                              ↳ QDP
                                ↳ QDPOrderProof
                                  ↳ QDP
                                    ↳ QDPOrderProof
                                      ↳ QDP
                                        ↳ QDPOrderProof
                                          ↳ QDP
                                            ↳ QDPOrderProof
                                              ↳ QDP
                                                ↳ QDPOrderProof
                                                  ↳ QDP
                                                    ↳ QDPOrderProof
                                                      ↳ QDP
                                                        ↳ QDPOrderProof
                                                          ↳ QDP
                                                            ↳ QDPOrderProof
                                                              ↳ QDP
                                                                ↳ QDPOrderProof
                                                                  ↳ QDP
                                                                    ↳ QDPOrderProof
                                                                      ↳ QDP
                                                                        ↳ QDPOrderProof
                                                                          ↳ QDP
                                                                            ↳ QDPOrderProof
                                                                              ↳ QDP
                                                                                ↳ QDPOrderProof
                                                                                  ↳ QDP
                                                                                    ↳ QDPOrderProof
                                                                                      ↳ QDP
                                                                                        ↳ QDPOrderProof
                                                                                          ↳ QDP
                                                                                            ↳ QDPOrderProof
                                                                                              ↳ QDP
                                                                                                ↳ QDPOrderProof
                                                                                                  ↳ QDP
                                                                                                    ↳ QDPOrderProof
                                                                                                      ↳ QDP
                                                                                                        ↳ QDPOrderProof
                                                                                                          ↳ QDP
                                                                                                            ↳ QDPOrderProof
QDP

Q DP problem:
The TRS P consists of the following rules:

TOP(ok(U92(x0, x1, x2))) → TOP(U92(active(x0), x1, x2))
TOP(mark(U51(x0, x1))) → TOP(U51(proper(x0), proper(x1)))
TOP(ok(U45(x0, x1))) → TOP(U45(active(x0), x1))
TOP(mark(U83(x0, x1, x2))) → TOP(U83(proper(x0), proper(x1), proper(x2)))
TOP(ok(U71(x0))) → TOP(U71(active(x0)))
TOP(mark(U13(x0))) → TOP(U13(proper(x0)))
TOP(mark(U44(x0, x1, x2))) → TOP(U44(proper(x0), proper(x1), proper(x2)))
TOP(ok(U22(x0, x1))) → TOP(U22(active(x0), x1))
TOP(mark(U92(x0, x1, x2))) → TOP(U92(proper(x0), proper(x1), proper(x2)))
TOP(ok(U84(x0, x1, x2))) → TOP(U84(active(x0), x1, x2))
TOP(ok(U93(x0, x1, x2))) → TOP(U93(active(x0), x1, x2))
TOP(ok(U94(x0, x1))) → TOP(U94(active(x0), x1))
TOP(mark(U46(x0))) → TOP(U46(proper(x0)))
TOP(ok(U86(x0))) → TOP(U86(active(x0)))
TOP(mark(U42(x0, x1, x2))) → TOP(U42(proper(x0), proper(x1), proper(x2)))
TOP(ok(U85(x0, x1))) → TOP(U85(active(x0), x1))
TOP(mark(U31(x0, x1))) → TOP(U31(proper(x0), proper(x1)))
TOP(mark(U93(x0, x1, x2))) → TOP(U93(proper(x0), proper(x1), proper(x2)))
TOP(ok(U81(x0, x1, x2))) → TOP(U81(active(x0), x1, x2))
TOP(ok(s(x0))) → TOP(s(active(x0)))
TOP(ok(U31(x0, x1))) → TOP(U31(active(x0), x1))
TOP(ok(U33(x0))) → TOP(U33(active(x0)))
TOP(ok(U51(x0, x1))) → TOP(U51(active(x0), x1))
TOP(ok(U82(x0, x1, x2))) → TOP(U82(active(x0), x1, x2))
TOP(ok(U44(x0, x1, x2))) → TOP(U44(active(x0), x1, x2))
TOP(mark(U84(x0, x1, x2))) → TOP(U84(proper(x0), proper(x1), proper(x2)))
TOP(mark(U86(x0))) → TOP(U86(proper(x0)))
TOP(ok(U91(x0, x1, x2))) → TOP(U91(active(x0), x1, x2))
TOP(ok(U52(x0))) → TOP(U52(active(x0)))
TOP(ok(U23(x0))) → TOP(U23(active(x0)))
TOP(mark(U45(x0, x1))) → TOP(U45(proper(x0), proper(x1)))
TOP(ok(U11(x0, x1))) → TOP(U11(active(x0), x1))
TOP(mark(length(x0))) → TOP(length(proper(x0)))
TOP(mark(U71(x0))) → TOP(U71(proper(x0)))
TOP(mark(U21(x0, x1))) → TOP(U21(proper(x0), proper(x1)))
TOP(ok(U83(x0, x1, x2))) → TOP(U83(active(x0), x1, x2))
TOP(mark(U85(x0, x1))) → TOP(U85(proper(x0), proper(x1)))
TOP(ok(U12(x0, x1))) → TOP(U12(active(x0), x1))
TOP(ok(cons(x0, x1))) → TOP(cons(active(x0), x1))
TOP(mark(U41(x0, x1, x2))) → TOP(U41(proper(x0), proper(x1), proper(x2)))
TOP(mark(U22(x0, x1))) → TOP(U22(proper(x0), proper(x1)))
TOP(ok(U21(x0, x1))) → TOP(U21(active(x0), x1))
TOP(mark(U33(x0))) → TOP(U33(proper(x0)))
TOP(mark(U12(x0, x1))) → TOP(U12(proper(x0), proper(x1)))
TOP(ok(length(x0))) → TOP(length(active(x0)))
TOP(mark(s(x0))) → TOP(s(proper(x0)))
TOP(mark(U52(x0))) → TOP(U52(proper(x0)))
TOP(ok(U43(x0, x1, x2))) → TOP(U43(active(x0), x1, x2))
TOP(mark(U82(x0, x1, x2))) → TOP(U82(proper(x0), proper(x1), proper(x2)))
TOP(ok(U41(x0, x1, x2))) → TOP(U41(active(x0), x1, x2))
TOP(ok(U13(x0))) → TOP(U13(active(x0)))
TOP(ok(U46(x0))) → TOP(U46(active(x0)))
TOP(mark(U61(x0))) → TOP(U61(proper(x0)))
TOP(mark(U91(x0, x1, x2))) → TOP(U91(proper(x0), proper(x1), proper(x2)))
TOP(mark(U81(x0, x1, x2))) → TOP(U81(proper(x0), proper(x1), proper(x2)))
TOP(mark(U94(x0, x1))) → TOP(U94(proper(x0), proper(x1)))
TOP(ok(U32(x0, x1))) → TOP(U32(active(x0), x1))
TOP(mark(U43(x0, x1, x2))) → TOP(U43(proper(x0), proper(x1), proper(x2)))
TOP(mark(cons(x0, x1))) → TOP(cons(proper(x0), proper(x1)))
TOP(ok(U61(x0))) → TOP(U61(active(x0)))
TOP(mark(U32(x0, x1))) → TOP(U32(proper(x0), proper(x1)))
TOP(mark(U23(x0))) → TOP(U23(proper(x0)))
TOP(ok(U42(x0, x1, x2))) → TOP(U42(active(x0), x1, x2))
TOP(mark(U11(x0, x1))) → TOP(U11(proper(x0), proper(x1)))

The TRS R consists of the following rules:

proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X1, X2)) → U12(proper(X1), proper(X2))
proper(isNatIListKind(X)) → isNatIListKind(proper(X))
proper(U13(X)) → U13(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U23(X)) → U23(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X1, X2)) → U32(proper(X1), proper(X2))
proper(U33(X)) → U33(proper(X))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(U43(X1, X2, X3)) → U43(proper(X1), proper(X2), proper(X3))
proper(U44(X1, X2, X3)) → U44(proper(X1), proper(X2), proper(X3))
proper(U45(X1, X2)) → U45(proper(X1), proper(X2))
proper(U46(X)) → U46(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(U61(X)) → U61(proper(X))
proper(U71(X)) → U71(proper(X))
proper(U81(X1, X2, X3)) → U81(proper(X1), proper(X2), proper(X3))
proper(U82(X1, X2, X3)) → U82(proper(X1), proper(X2), proper(X3))
proper(U83(X1, X2, X3)) → U83(proper(X1), proper(X2), proper(X3))
proper(U84(X1, X2, X3)) → U84(proper(X1), proper(X2), proper(X3))
proper(U85(X1, X2)) → U85(proper(X1), proper(X2))
proper(U86(X)) → U86(proper(X))
proper(U91(X1, X2, X3)) → U91(proper(X1), proper(X2), proper(X3))
proper(U92(X1, X2, X3)) → U92(proper(X1), proper(X2), proper(X3))
proper(U93(X1, X2, X3)) → U93(proper(X1), proper(X2), proper(X3))
proper(U94(X1, X2)) → U94(proper(X1), proper(X2))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
length(mark(X)) → mark(length(X))
length(ok(X)) → ok(length(X))
s(mark(X)) → mark(s(X))
s(ok(X)) → ok(s(X))
U94(mark(X1), X2) → mark(U94(X1, X2))
U94(ok(X1), ok(X2)) → ok(U94(X1, X2))
U93(mark(X1), X2, X3) → mark(U93(X1, X2, X3))
U93(ok(X1), ok(X2), ok(X3)) → ok(U93(X1, X2, X3))
U92(mark(X1), X2, X3) → mark(U92(X1, X2, X3))
U92(ok(X1), ok(X2), ok(X3)) → ok(U92(X1, X2, X3))
U91(mark(X1), X2, X3) → mark(U91(X1, X2, X3))
U91(ok(X1), ok(X2), ok(X3)) → ok(U91(X1, X2, X3))
U86(mark(X)) → mark(U86(X))
U86(ok(X)) → ok(U86(X))
U85(mark(X1), X2) → mark(U85(X1, X2))
U85(ok(X1), ok(X2)) → ok(U85(X1, X2))
U84(mark(X1), X2, X3) → mark(U84(X1, X2, X3))
U84(ok(X1), ok(X2), ok(X3)) → ok(U84(X1, X2, X3))
U83(mark(X1), X2, X3) → mark(U83(X1, X2, X3))
U83(ok(X1), ok(X2), ok(X3)) → ok(U83(X1, X2, X3))
U82(mark(X1), X2, X3) → mark(U82(X1, X2, X3))
U82(ok(X1), ok(X2), ok(X3)) → ok(U82(X1, X2, X3))
U81(mark(X1), X2, X3) → mark(U81(X1, X2, X3))
U81(ok(X1), ok(X2), ok(X3)) → ok(U81(X1, X2, X3))
U71(mark(X)) → mark(U71(X))
U71(ok(X)) → ok(U71(X))
U61(mark(X)) → mark(U61(X))
U61(ok(X)) → ok(U61(X))
U52(mark(X)) → mark(U52(X))
U52(ok(X)) → ok(U52(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
isNatIList(ok(X)) → ok(isNatIList(X))
U46(mark(X)) → mark(U46(X))
U46(ok(X)) → ok(U46(X))
U45(mark(X1), X2) → mark(U45(X1, X2))
U45(ok(X1), ok(X2)) → ok(U45(X1, X2))
U44(mark(X1), X2, X3) → mark(U44(X1, X2, X3))
U44(ok(X1), ok(X2), ok(X3)) → ok(U44(X1, X2, X3))
U43(mark(X1), X2, X3) → mark(U43(X1, X2, X3))
U43(ok(X1), ok(X2), ok(X3)) → ok(U43(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U33(mark(X)) → mark(U33(X))
U33(ok(X)) → ok(U33(X))
U32(mark(X1), X2) → mark(U32(X1, X2))
U32(ok(X1), ok(X2)) → ok(U32(X1, X2))
U31(mark(X1), X2) → mark(U31(X1, X2))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U23(mark(X)) → mark(U23(X))
U23(ok(X)) → ok(U23(X))
isNatKind(ok(X)) → ok(isNatKind(X))
U22(mark(X1), X2) → mark(U22(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U21(mark(X1), X2) → mark(U21(X1, X2))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
isNatList(ok(X)) → ok(isNatList(X))
U13(mark(X)) → mark(U13(X))
U13(ok(X)) → ok(U13(X))
isNatIListKind(ok(X)) → ok(isNatIListKind(X))
U12(mark(X1), X2) → mark(U12(X1, X2))
U12(ok(X1), ok(X2)) → ok(U12(X1, X2))
U11(mark(X1), X2) → mark(U11(X1, X2))
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
cons(mark(X1), X2) → mark(cons(X1, X2))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
active(zeros) → mark(cons(0, zeros))
active(U11(tt, V1)) → mark(U12(isNatIListKind(V1), V1))
active(U12(tt, V1)) → mark(U13(isNatList(V1)))
active(U13(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V)) → mark(U32(isNatIListKind(V), V))
active(U32(tt, V)) → mark(U33(isNatList(V)))
active(U33(tt)) → mark(tt)
active(U41(tt, V1, V2)) → mark(U42(isNatKind(V1), V1, V2))
active(U42(tt, V1, V2)) → mark(U43(isNatIListKind(V2), V1, V2))
active(U43(tt, V1, V2)) → mark(U44(isNatIListKind(V2), V1, V2))
active(U44(tt, V1, V2)) → mark(U45(isNat(V1), V2))
active(U45(tt, V2)) → mark(U46(isNatIList(V2)))
active(U46(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatIListKind(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt)) → mark(tt)
active(U71(tt)) → mark(tt)
active(U81(tt, V1, V2)) → mark(U82(isNatKind(V1), V1, V2))
active(U82(tt, V1, V2)) → mark(U83(isNatIListKind(V2), V1, V2))
active(U83(tt, V1, V2)) → mark(U84(isNatIListKind(V2), V1, V2))
active(U84(tt, V1, V2)) → mark(U85(isNat(V1), V2))
active(U85(tt, V2)) → mark(U86(isNatList(V2)))
active(U86(tt)) → mark(tt)
active(U91(tt, L, N)) → mark(U92(isNatIListKind(L), L, N))
active(U92(tt, L, N)) → mark(U93(isNat(N), L, N))
active(U93(tt, L, N)) → mark(U94(isNatKind(N), L))
active(U94(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatIListKind(V1), V1))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatIList(V)) → mark(U31(isNatIListKind(V), V))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNatKind(V1), V1, V2))
active(isNatIListKind(nil)) → mark(tt)
active(isNatIListKind(zeros)) → mark(tt)
active(isNatIListKind(cons(V1, V2))) → mark(U51(isNatKind(V1), V2))
active(isNatKind(0)) → mark(tt)
active(isNatKind(length(V1))) → mark(U61(isNatIListKind(V1)))
active(isNatKind(s(V1))) → mark(U71(isNatKind(V1)))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U81(isNatKind(V1), V1, V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U91(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X1, X2)) → U12(active(X1), X2)
active(U13(X)) → U13(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X1, X2)) → U32(active(X1), X2)
active(U33(X)) → U33(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(active(X1), X2, X3)
active(U43(X1, X2, X3)) → U43(active(X1), X2, X3)
active(U44(X1, X2, X3)) → U44(active(X1), X2, X3)
active(U45(X1, X2)) → U45(active(X1), X2)
active(U46(X)) → U46(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X)) → U61(active(X))
active(U71(X)) → U71(active(X))
active(U81(X1, X2, X3)) → U81(active(X1), X2, X3)
active(U82(X1, X2, X3)) → U82(active(X1), X2, X3)
active(U83(X1, X2, X3)) → U83(active(X1), X2, X3)
active(U84(X1, X2, X3)) → U84(active(X1), X2, X3)
active(U85(X1, X2)) → U85(active(X1), X2)
active(U86(X)) → U86(active(X))
active(U91(X1, X2, X3)) → U91(active(X1), X2, X3)
active(U92(X1, X2, X3)) → U92(active(X1), X2, X3)
active(U93(X1, X2, X3)) → U93(active(X1), X2, X3)
active(U94(X1, X2)) → U94(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.